/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:39:07,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:39:07,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:39:07,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:39:07,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:39:07,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:39:07,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:39:07,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:39:07,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:39:07,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:39:07,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:39:07,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:39:07,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:39:07,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:39:07,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:39:07,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:39:07,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:39:07,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:39:07,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:39:07,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:39:07,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:39:07,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:39:07,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:39:07,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:39:07,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:39:07,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:39:07,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:39:07,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:39:07,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:39:07,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:39:07,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:39:07,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:39:07,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:39:07,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:39:07,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:39:07,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:39:07,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:39:07,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:39:07,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:39:07,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:39:07,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:39:07,214 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:39:07,228 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:39:07,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:39:07,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:39:07,230 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:39:07,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:39:07,230 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:39:07,230 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:39:07,230 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:39:07,231 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:39:07,231 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:39:07,231 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:39:07,231 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:39:07,231 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:39:07,231 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:39:07,232 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:39:07,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:39:07,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:39:07,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:39:07,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:39:07,233 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:39:07,233 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:39:07,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:39:07,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:39:07,233 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:39:07,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:39:07,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:39:07,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:39:07,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:39:07,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:39:07,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:39:07,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:39:07,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:39:07,420 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:39:07,420 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:39:07,421 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:39:07,481 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_1El4DZ/tmp/aa9c1e0c6c884ce4a9f6017d3423fe66/FLAG77598a596 [2020-07-01 12:39:07,821 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:39:07,821 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:39:07,822 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:39:07,828 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_1El4DZ/tmp/aa9c1e0c6c884ce4a9f6017d3423fe66/FLAG77598a596 [2020-07-01 12:39:08,234 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_1El4DZ/tmp/aa9c1e0c6c884ce4a9f6017d3423fe66 [2020-07-01 12:39:08,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:39:08,246 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:39:08,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:39:08,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:39:08,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:39:08,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f642ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08, skipping insertion in model container [2020-07-01 12:39:08,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:39:08,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:39:08,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:39:08,526 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:39:08,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:39:08,561 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:39:08,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08 WrapperNode [2020-07-01 12:39:08,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:39:08,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:39:08,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:39:08,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:39:08,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:39:08,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:39:08,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:39:08,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:39:08,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:39:08,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:39:08,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:39:08,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:39:08,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:39:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:39:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:39:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:39:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:39:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:39:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:39:09,137 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:39:09,138 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:39:09,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:09 BoogieIcfgContainer [2020-07-01 12:39:09,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:39:09,144 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:39:09,144 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:39:09,146 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:39:09,147 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:09" (1/1) ... [2020-07-01 12:39:09,165 INFO L313 BlockEncoder]: Initial Icfg 100 locations, 104 edges [2020-07-01 12:39:09,167 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:39:09,167 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:39:09,168 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:39:09,168 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:39:09,170 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:39:09,171 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:39:09,171 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:39:09,205 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:39:09,248 INFO L200 BlockEncoder]: SBE split 56 edges [2020-07-01 12:39:09,254 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:39:09,256 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:39:09,296 INFO L100 BaseMinimizeStates]: Removed 26 edges and 13 locations by large block encoding [2020-07-01 12:39:09,299 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:39:09,300 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:39:09,301 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:39:09,301 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:39:09,302 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:39:09,302 INFO L313 BlockEncoder]: Encoded RCFG 86 locations, 151 edges [2020-07-01 12:39:09,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:39:09 BasicIcfg [2020-07-01 12:39:09,303 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:39:09,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:39:09,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:39:09,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:39:09,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:39:08" (1/4) ... [2020-07-01 12:39:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dacf21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:39:09, skipping insertion in model container [2020-07-01 12:39:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (2/4) ... [2020-07-01 12:39:09,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dacf21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:39:09, skipping insertion in model container [2020-07-01 12:39:09,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:09" (3/4) ... [2020-07-01 12:39:09,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dacf21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:09, skipping insertion in model container [2020-07-01 12:39:09,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:39:09" (4/4) ... [2020-07-01 12:39:09,311 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:39:09,321 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:39:09,329 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2020-07-01 12:39:09,343 INFO L251 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2020-07-01 12:39:09,367 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:39:09,367 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:39:09,367 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:39:09,367 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:39:09,367 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:39:09,368 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:39:09,368 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:39:09,368 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:39:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2020-07-01 12:39:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:39:09,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:39:09,391 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 225449, now seen corresponding path program 1 times [2020-07-01 12:39:09,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566915] [2020-07-01 12:39:09,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566915] [2020-07-01 12:39:09,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:09,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878587290] [2020-07-01 12:39:09,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:09,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,584 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2020-07-01 12:39:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,825 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2020-07-01 12:39:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:09,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:39:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,839 INFO L225 Difference]: With dead ends: 170 [2020-07-01 12:39:09,839 INFO L226 Difference]: Without dead ends: 86 [2020-07-01 12:39:09,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-01 12:39:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-07-01 12:39:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-01 12:39:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 144 transitions. [2020-07-01 12:39:09,885 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 144 transitions. Word has length 3 [2020-07-01 12:39:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,885 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 144 transitions. [2020-07-01 12:39:09,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 144 transitions. [2020-07-01 12:39:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:39:09,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:39:09,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:39:09,888 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash 225573, now seen corresponding path program 1 times [2020-07-01 12:39:09,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120533327] [2020-07-01 12:39:09,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120533327] [2020-07-01 12:39:09,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:09,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25239947] [2020-07-01 12:39:09,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:09,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,951 INFO L87 Difference]: Start difference. First operand 86 states and 144 transitions. Second operand 3 states. [2020-07-01 12:39:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,186 INFO L93 Difference]: Finished difference Result 86 states and 144 transitions. [2020-07-01 12:39:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:10,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:39:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,188 INFO L225 Difference]: With dead ends: 86 [2020-07-01 12:39:10,189 INFO L226 Difference]: Without dead ends: 77 [2020-07-01 12:39:10,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-01 12:39:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-01 12:39:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-01 12:39:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 126 transitions. [2020-07-01 12:39:10,198 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 126 transitions. Word has length 3 [2020-07-01 12:39:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,198 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 126 transitions. [2020-07-01 12:39:10,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2020-07-01 12:39:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:39:10,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:39:10,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:39:10,199 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash 225575, now seen corresponding path program 1 times [2020-07-01 12:39:10,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925274853] [2020-07-01 12:39:10,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925274853] [2020-07-01 12:39:10,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:10,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667884535] [2020-07-01 12:39:10,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:10,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:10,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,232 INFO L87 Difference]: Start difference. First operand 77 states and 126 transitions. Second operand 3 states. [2020-07-01 12:39:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,378 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2020-07-01 12:39:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:10,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:39:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,380 INFO L225 Difference]: With dead ends: 86 [2020-07-01 12:39:10,380 INFO L226 Difference]: Without dead ends: 77 [2020-07-01 12:39:10,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-01 12:39:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-01 12:39:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-01 12:39:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2020-07-01 12:39:10,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 3 [2020-07-01 12:39:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,388 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2020-07-01 12:39:10,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2020-07-01 12:39:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:39:10,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:39:10,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:39:10,389 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash 225576, now seen corresponding path program 1 times [2020-07-01 12:39:10,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075196698] [2020-07-01 12:39:10,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075196698] [2020-07-01 12:39:10,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:10,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171841211] [2020-07-01 12:39:10,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:10,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,432 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand 3 states. [2020-07-01 12:39:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,587 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2020-07-01 12:39:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:10,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:39:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,589 INFO L225 Difference]: With dead ends: 77 [2020-07-01 12:39:10,589 INFO L226 Difference]: Without dead ends: 68 [2020-07-01 12:39:10,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-01 12:39:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-01 12:39:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-01 12:39:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 108 transitions. [2020-07-01 12:39:10,595 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 108 transitions. Word has length 3 [2020-07-01 12:39:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,595 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 108 transitions. [2020-07-01 12:39:10,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2020-07-01 12:39:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:39:10,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:39:10,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:39:10,597 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash 6996473, now seen corresponding path program 1 times [2020-07-01 12:39:10,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189938255] [2020-07-01 12:39:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189938255] [2020-07-01 12:39:10,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:10,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500895574] [2020-07-01 12:39:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:10,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:10,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,630 INFO L87 Difference]: Start difference. First operand 68 states and 108 transitions. Second operand 3 states. [2020-07-01 12:39:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,755 INFO L93 Difference]: Finished difference Result 68 states and 108 transitions. [2020-07-01 12:39:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:10,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:39:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,756 INFO L225 Difference]: With dead ends: 68 [2020-07-01 12:39:10,757 INFO L226 Difference]: Without dead ends: 59 [2020-07-01 12:39:10,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-01 12:39:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-01 12:39:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-01 12:39:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2020-07-01 12:39:10,762 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 4 [2020-07-01 12:39:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,762 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2020-07-01 12:39:10,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2020-07-01 12:39:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:39:10,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:39:10,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:39:10,764 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,764 INFO L82 PathProgramCache]: Analyzing trace with hash 6996475, now seen corresponding path program 1 times [2020-07-01 12:39:10,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788890536] [2020-07-01 12:39:10,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788890536] [2020-07-01 12:39:10,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:10,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043849522] [2020-07-01 12:39:10,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:10,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:10,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,800 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 3 states. [2020-07-01 12:39:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,897 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2020-07-01 12:39:10,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:10,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:39:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,899 INFO L225 Difference]: With dead ends: 59 [2020-07-01 12:39:10,899 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:39:10,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:39:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 12:39:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 12:39:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2020-07-01 12:39:10,904 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 4 [2020-07-01 12:39:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,904 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2020-07-01 12:39:10,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2020-07-01 12:39:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:39:10,905 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:10,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:39:10,905 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1177696157, now seen corresponding path program 1 times [2020-07-01 12:39:10,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659232776] [2020-07-01 12:39:10,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659232776] [2020-07-01 12:39:10,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:39:10,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741500805] [2020-07-01 12:39:10,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:10,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:10,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:10,941 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand 3 states. [2020-07-01 12:39:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,007 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2020-07-01 12:39:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:11,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 12:39:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,008 INFO L225 Difference]: With dead ends: 98 [2020-07-01 12:39:11,008 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:39:11,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:39:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 12:39:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 12:39:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2020-07-01 12:39:11,012 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 13 [2020-07-01 12:39:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,013 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2020-07-01 12:39:11,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2020-07-01 12:39:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:39:11,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:39:11,015 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -239720605, now seen corresponding path program 1 times [2020-07-01 12:39:11,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356565967] [2020-07-01 12:39:11,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356565967] [2020-07-01 12:39:11,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:11,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990474572] [2020-07-01 12:39:11,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:11,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,063 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand 3 states. [2020-07-01 12:39:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,145 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2020-07-01 12:39:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:11,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:39:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,146 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:39:11,146 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:39:11,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:39:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:39:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:39:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2020-07-01 12:39:11,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 15 [2020-07-01 12:39:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,150 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2020-07-01 12:39:11,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2020-07-01 12:39:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:39:11,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:39:11,152 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash -239720603, now seen corresponding path program 1 times [2020-07-01 12:39:11,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82191733] [2020-07-01 12:39:11,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82191733] [2020-07-01 12:39:11,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:11,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927047054] [2020-07-01 12:39:11,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:11,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,193 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2020-07-01 12:39:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,233 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2020-07-01 12:39:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:11,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:39:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,234 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:39:11,234 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:39:11,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:39:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:39:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:39:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-07-01 12:39:11,239 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2020-07-01 12:39:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,239 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-07-01 12:39:11,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-01 12:39:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:39:11,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:39:11,240 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash -239720602, now seen corresponding path program 1 times [2020-07-01 12:39:11,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131158544] [2020-07-01 12:39:11,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131158544] [2020-07-01 12:39:11,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:11,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50717436] [2020-07-01 12:39:11,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:11,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:11,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,284 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 3 states. [2020-07-01 12:39:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,341 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-07-01 12:39:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:11,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:39:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,343 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:39:11,343 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:39:11,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:39:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:39:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:39:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:39:11,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-01 12:39:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,344 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:39:11,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:39:11,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:39:11,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:39:11,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr51REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr47REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,382 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,383 INFO L268 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point L12-6(lines 12 17) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr48REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr44REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,384 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 14) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point L13-7(lines 12 17) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,385 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr49REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,386 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr45REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,387 INFO L268 CegarLoopResult]: For program point L15-7(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,388 INFO L268 CegarLoopResult]: For program point L15-8(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,388 INFO L268 CegarLoopResult]: For program point L15-9(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,388 INFO L264 CegarLoopResult]: At program point L15-12(lines 12 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~z~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 12:39:11,388 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,389 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point L16-4(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point L16-5(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point L16-7(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point L16-8(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point L16-9(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr50REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr46REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,390 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:11,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:39:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:11,392 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:39:11,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:39:11,395 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:39:11,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:11,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,413 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,413 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:11,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:11 BasicIcfg [2020-07-01 12:39:11,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:39:11,416 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:39:11,416 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:39:11,420 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:39:11,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:11,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:39:08" (1/5) ... [2020-07-01 12:39:11,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3e2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:39:11, skipping insertion in model container [2020-07-01 12:39:11,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:11,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (2/5) ... [2020-07-01 12:39:11,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3e2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:39:11, skipping insertion in model container [2020-07-01 12:39:11,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:11,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:09" (3/5) ... [2020-07-01 12:39:11,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3e2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:39:11, skipping insertion in model container [2020-07-01 12:39:11,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:11,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:39:09" (4/5) ... [2020-07-01 12:39:11,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3e2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:39:11, skipping insertion in model container [2020-07-01 12:39:11,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:11,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:11" (5/5) ... [2020-07-01 12:39:11,424 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:39:11,445 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:39:11,446 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:39:11,446 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:39:11,446 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:39:11,446 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:39:11,446 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:39:11,446 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:39:11,446 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:39:11,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2020-07-01 12:39:11,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-07-01 12:39:11,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:39:11,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:39:11,464 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:39:11,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,464 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:39:11,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2020-07-01 12:39:11,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-07-01 12:39:11,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:39:11,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:39:11,468 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:39:11,468 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,473 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue [194] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [295] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~mem20, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem17, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 58#L9true [406] L9-->L10: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_57| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_63| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_38| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_38| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_37|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_22)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_57|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_57|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 15#L10true [407] L10-->L15-12: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_main_~y~0.base_31) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_22) (= (store |v_#memory_int_40| v_ULTIMATE.start_main_~y~0.base_31 (store (select |v_#memory_int_40| v_ULTIMATE.start_main_~y~0.base_31) v_ULTIMATE.start_main_~y~0.offset_22 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_39|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_22 4) (select |v_#length_58| v_ULTIMATE.start_main_~y~0.base_31))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_31, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_22, #length=|v_#length_58|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_31, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_22, #length=|v_#length_58|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 22#L15-12true [2020-07-01 12:39:11,475 INFO L796 eck$LassoCheckResult]: Loop: 22#L15-12true [143] L15-12-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~y~0.base_7)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 67#L12-1true [308] L12-1-->L12-2: Formula: (and (not |v_ULTIMATE.start_main_#t~short7_2|) (>= 0 |v_ULTIMATE.start_main_#t~mem5_3|)) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 63#L12-2true [174] L12-2-->L12-6: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 29#L12-6true [150] L12-6-->L13: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem5] 86#L13true [228] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_13| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem8_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 85#L13-1true [225] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_10)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 84#L13-2true [223] L13-2-->L13-3: Formula: (< |v_ULTIMATE.start_main_#t~mem9_4| |v_ULTIMATE.start_main_#t~mem8_4|) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_4|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_4|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8] 81#L13-3true [220] L13-3-->L13-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_10) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_13)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_13)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 59#L13-4true [411] L13-4-->L13-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_20 4) (select |v_#length_59| v_ULTIMATE.start_main_~z~0.base_28)) (= 1 (select |v_#valid_71| v_ULTIMATE.start_main_~z~0.base_28)) (= (store |v_#memory_int_42| v_ULTIMATE.start_main_~z~0.base_28 (store (select |v_#memory_int_42| v_ULTIMATE.start_main_~z~0.base_28) v_ULTIMATE.start_main_~z~0.offset_20 |v_ULTIMATE.start_main_#t~mem10_6|)) |v_#memory_int_41|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_20)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_28, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_20, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_42|, #length=|v_#length_59|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_28, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_20, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_41|, #length=|v_#length_59|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #memory_int] 52#L13-7true [203] L13-7-->L16: Formula: (= |v_ULTIMATE.start_main_#t~nondet12_5| 0) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12] 50#L16true [199] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~y~0.base_25)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_25)) (= |v_ULTIMATE.start_main_#t~mem18_2| (select (select |v_#memory_int_26| v_ULTIMATE.start_main_~y~0.base_25) v_ULTIMATE.start_main_~y~0.offset_18))) InVars {#memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_25, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_41|, #valid=|v_#valid_43|} OutVars{#valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_25, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18] 49#L16-1true [195] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (= |v_ULTIMATE.start_main_#t~mem19_2| (select (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~x~0.base_22)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~x~0.base_22))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_27|, #length=|v_#length_43|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_45|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_27|, #length=|v_#length_43|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19] 74#L16-2true [413] L16-2-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_61| v_ULTIMATE.start_main_~x~0.base_32)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_73| v_ULTIMATE.start_main_~x~0.base_32)) (= (store |v_#memory_int_46| v_ULTIMATE.start_main_~x~0.base_32 (store (select |v_#memory_int_46| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~mem18_6| |v_ULTIMATE.start_main_#t~mem19_6|))) |v_#memory_int_45|)) InVars {#valid=|v_#valid_73|, #memory_int=|v_#memory_int_46|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_6|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_6|, #length=|v_#length_61|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_73|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_5|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_5|, #length=|v_#length_61|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, #memory_int, ULTIMATE.start_main_#t~mem18] 69#L16-4true [212] L16-4-->L16-5: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_14 4) (select |v_#length_47| v_ULTIMATE.start_main_~z~0.base_19)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_14) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem20_2| (select (select |v_#memory_int_30| v_ULTIMATE.start_main_~z~0.base_19) v_ULTIMATE.start_main_~z~0.offset_14))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_19, #memory_int=|v_#memory_int_30|, #length=|v_#length_47|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_14, #valid=|v_#valid_49|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_19, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_14, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_2|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20] 68#L16-5true [415] L16-5-->L16-7: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_24) (= |v_#memory_int_49| (store |v_#memory_int_50| v_ULTIMATE.start_main_~y~0.base_33 (store (select |v_#memory_int_50| v_ULTIMATE.start_main_~y~0.base_33) v_ULTIMATE.start_main_~y~0.offset_24 (+ |v_ULTIMATE.start_main_#t~mem20_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~y~0.offset_24 4) (select |v_#length_63| v_ULTIMATE.start_main_~y~0.base_33)) (= 1 (select |v_#valid_75| v_ULTIMATE.start_main_~y~0.base_33))) InVars {ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_6|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_33, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_24, #length=|v_#length_63|} OutVars{ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_5|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_33, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_24, #length=|v_#length_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20, #memory_int] 37#L16-7true [191] L16-7-->L16-8: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_51| v_ULTIMATE.start_main_~x~0.base_28)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_main_~x~0.base_28)) (= (select (select |v_#memory_int_33| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20) |v_ULTIMATE.start_main_#t~mem21_2|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #memory_int=|v_#memory_int_33|, #length=|v_#length_51|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28, #valid=|v_#valid_53|} OutVars{ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_2|, #valid=|v_#valid_53|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #memory_int=|v_#memory_int_33|, #length=|v_#length_51|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem21] 34#L16-8true [188] L16-8-->L16-9: Formula: (and (= 1 (select |v_#valid_55| v_ULTIMATE.start_main_~z~0.base_22)) (= |v_ULTIMATE.start_main_#t~mem22_2| (select (select |v_#memory_int_34| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_16) (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_53| v_ULTIMATE.start_main_~z~0.base_22))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, #memory_int=|v_#memory_int_34|, #length=|v_#length_53|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_55|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_2|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_34|, #length=|v_#length_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22] 31#L16-9true [417] L16-9-->L15-12: Formula: (and (= |v_#memory_int_53| (store |v_#memory_int_54| v_ULTIMATE.start_main_~z~0.base_30 (store (select |v_#memory_int_54| v_ULTIMATE.start_main_~z~0.base_30) v_ULTIMATE.start_main_~z~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem21_6| |v_ULTIMATE.start_main_#t~mem22_6|)))) (= 1 (select |v_#valid_77| v_ULTIMATE.start_main_~z~0.base_30)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_22) (<= (+ v_ULTIMATE.start_main_~z~0.offset_22 4) (select |v_#length_65| v_ULTIMATE.start_main_~z~0.base_30))) InVars {ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_30, ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_22, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_54|, #length=|v_#length_65|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_30, ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_22, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_53|, #length=|v_#length_65|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem21, #memory_int] 22#L15-12true [2020-07-01 12:39:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 6999463, now seen corresponding path program 1 times [2020-07-01 12:39:11,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788441805] [2020-07-01 12:39:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788441805] [2020-07-01 12:39:11,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:11,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423241121] [2020-07-01 12:39:11,492 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:39:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1359548496, now seen corresponding path program 1 times [2020-07-01 12:39:11,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024515472] [2020-07-01 12:39:11,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024515472] [2020-07-01 12:39:11,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:39:11,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548065590] [2020-07-01 12:39:11,507 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:39:11,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:11,509 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2020-07-01 12:39:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,642 INFO L93 Difference]: Finished difference Result 86 states and 144 transitions. [2020-07-01 12:39:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:11,644 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:39:11,649 INFO L168 Benchmark]: Toolchain (without parser) took 3401.60 ms. Allocated memory was 514.9 MB in the beginning and 601.9 MB in the end (delta: 87.0 MB). Free memory was 438.3 MB in the beginning and 484.2 MB in the end (delta: -45.9 MB). Peak memory consumption was 41.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,649 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:39:11,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.53 ms. Allocated memory was 514.9 MB in the beginning and 566.8 MB in the end (delta: 51.9 MB). Free memory was 438.3 MB in the beginning and 533.5 MB in the end (delta: -95.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.37 ms. Allocated memory is still 566.8 MB. Free memory was 532.9 MB in the beginning and 531.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,651 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 566.8 MB. Free memory was 531.4 MB in the beginning and 529.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,651 INFO L168 Benchmark]: RCFGBuilder took 513.30 ms. Allocated memory is still 566.8 MB. Free memory was 529.4 MB in the beginning and 495.1 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,652 INFO L168 Benchmark]: BlockEncodingV2 took 159.26 ms. Allocated memory is still 566.8 MB. Free memory was 495.1 MB in the beginning and 476.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,652 INFO L168 Benchmark]: TraceAbstraction took 2111.89 ms. Allocated memory was 566.8 MB in the beginning and 601.9 MB in the end (delta: 35.1 MB). Free memory was 475.5 MB in the beginning and 524.1 MB in the end (delta: -48.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:39:11,653 INFO L168 Benchmark]: BuchiAutomizer took 229.99 ms. Allocated memory is still 601.9 MB. Free memory was 524.1 MB in the beginning and 484.2 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:11,656 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 100 locations, 104 edges - StatisticsResult: Encoded RCFG 86 locations, 151 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.53 ms. Allocated memory was 514.9 MB in the beginning and 566.8 MB in the end (delta: 51.9 MB). Free memory was 438.3 MB in the beginning and 533.5 MB in the end (delta: -95.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.37 ms. Allocated memory is still 566.8 MB. Free memory was 532.9 MB in the beginning and 531.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 566.8 MB. Free memory was 531.4 MB in the beginning and 529.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 513.30 ms. Allocated memory is still 566.8 MB. Free memory was 529.4 MB in the beginning and 495.1 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 159.26 ms. Allocated memory is still 566.8 MB. Free memory was 495.1 MB in the beginning and 476.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2111.89 ms. Allocated memory was 566.8 MB in the beginning and 601.9 MB in the end (delta: 35.1 MB). Free memory was 475.5 MB in the beginning and 524.1 MB in the end (delta: -48.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 229.99 ms. Allocated memory is still 601.9 MB. Free memory was 524.1 MB in the beginning and 484.2 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:39:11,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:11,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:11,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && 4 == unknown-#length-unknown[z]) && \valid[x] == 1) && 0 == z) && 1 == \valid[z]) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 86 locations, 52 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 737 SDslu, 69 SDs, 0 SdLazy, 764 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 3442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:39:04.997 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_1El4DZ/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:39:11.894 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check