./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test22-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efd11941ceab8dc56d9aa56f1950f714738654ba ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:14:06,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:14:06,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:14:06,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:14:06,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:14:06,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:14:06,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:14:06,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:14:06,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:14:06,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:14:06,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:14:06,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:14:06,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:14:06,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:14:06,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:14:06,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:14:06,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:14:06,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:14:06,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:14:06,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:14:06,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:14:06,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:14:06,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:14:06,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:14:06,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:14:06,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:14:06,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:14:06,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:14:06,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:14:06,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:14:06,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:14:06,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:14:06,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:14:06,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:14:06,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:14:06,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:14:06,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:14:06,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:14:06,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:14:06,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:14:06,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:14:06,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:14:06,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:14:06,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:14:06,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:14:06,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:14:06,575 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:14:06,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:14:06,575 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:14:06,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:14:06,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:14:06,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:14:06,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:14:06,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:14:06,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:14:06,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:14:06,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:14:06,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:14:06,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:14:06,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:14:06,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:14:06,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:14:06,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:14:06,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:14:06,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:14:06,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:14:06,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:14:06,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:14:06,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:14:06,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:14:06,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efd11941ceab8dc56d9aa56f1950f714738654ba [2019-11-19 21:14:06,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:14:06,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:14:06,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:14:06,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:14:06,946 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:14:06,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2019-11-19 21:14:07,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a75572d/a4d1ee26cc0544d08fb8e8c68b13a34e/FLAGb4a7fc441 [2019-11-19 21:14:07,493 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:14:07,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2019-11-19 21:14:07,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a75572d/a4d1ee26cc0544d08fb8e8c68b13a34e/FLAGb4a7fc441 [2019-11-19 21:14:07,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a75572d/a4d1ee26cc0544d08fb8e8c68b13a34e [2019-11-19 21:14:07,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:14:07,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:14:07,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:14:07,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:14:07,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:14:07,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:14:07" (1/1) ... [2019-11-19 21:14:07,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a04a46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:07, skipping insertion in model container [2019-11-19 21:14:07,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:14:07" (1/1) ... [2019-11-19 21:14:07,881 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:14:07,900 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:14:08,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:14:08,088 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:14:08,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:14:08,124 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:14:08,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08 WrapperNode [2019-11-19 21:14:08,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:14:08,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:14:08,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:14:08,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:14:08,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:14:08,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:14:08,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:14:08,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:14:08,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... [2019-11-19 21:14:08,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:14:08,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:14:08,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:14:08,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:14:08,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:14:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:14:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:14:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:14:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:14:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:14:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:14:08,650 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:14:08,650 INFO L285 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-19 21:14:08,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:14:08 BoogieIcfgContainer [2019-11-19 21:14:08,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:14:08,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:14:08,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:14:08,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:14:08,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:14:07" (1/3) ... [2019-11-19 21:14:08,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c33b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:14:08, skipping insertion in model container [2019-11-19 21:14:08,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:08" (2/3) ... [2019-11-19 21:14:08,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c33b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:14:08, skipping insertion in model container [2019-11-19 21:14:08,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:14:08" (3/3) ... [2019-11-19 21:14:08,667 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-11-19 21:14:08,677 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:14:08,685 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:14:08,695 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:14:08,716 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:14:08,716 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:14:08,716 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:14:08,716 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:14:08,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:14:08,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:14:08,717 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:14:08,717 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:14:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-19 21:14:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:14:08,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:08,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:08,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:08,742 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2019-11-19 21:14:08,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:08,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856662447] [2019-11-19 21:14:08,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:08,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856662447] [2019-11-19 21:14:08,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:14:08,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:14:08,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966208024] [2019-11-19 21:14:08,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:14:08,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:08,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:14:08,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:14:08,951 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-19 21:14:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:08,970 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-11-19 21:14:08,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:14:08,972 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-19 21:14:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:08,982 INFO L225 Difference]: With dead ends: 34 [2019-11-19 21:14:08,982 INFO L226 Difference]: Without dead ends: 21 [2019-11-19 21:14:08,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:14:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-19 21:14:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-19 21:14:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 21:14:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-19 21:14:09,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2019-11-19 21:14:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:09,021 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-19 21:14:09,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:14:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-19 21:14:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 21:14:09,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:09,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:09,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2019-11-19 21:14:09,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:09,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947985853] [2019-11-19 21:14:09,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:09,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947985853] [2019-11-19 21:14:09,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:14:09,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 21:14:09,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754207695] [2019-11-19 21:14:09,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:14:09,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:14:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:14:09,310 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-11-19 21:14:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:09,931 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-11-19 21:14:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:14:09,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 21:14:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:09,935 INFO L225 Difference]: With dead ends: 96 [2019-11-19 21:14:09,935 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 21:14:09,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:14:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 21:14:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2019-11-19 21:14:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 21:14:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 21:14:09,949 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-11-19 21:14:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:09,949 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 21:14:09,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:14:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-19 21:14:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 21:14:09,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:09,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:09,951 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2019-11-19 21:14:09,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:09,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969780035] [2019-11-19 21:14:09,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:10,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969780035] [2019-11-19 21:14:10,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:14:10,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 21:14:10,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585396722] [2019-11-19 21:14:10,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:14:10,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:14:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:14:10,123 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-11-19 21:14:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:10,553 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-19 21:14:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:14:10,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 21:14:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:10,556 INFO L225 Difference]: With dead ends: 91 [2019-11-19 21:14:10,556 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 21:14:10,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:14:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 21:14:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-11-19 21:14:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 21:14:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-19 21:14:10,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-19 21:14:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:10,567 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-19 21:14:10,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:14:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-19 21:14:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 21:14:10,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:10,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:10,569 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2019-11-19 21:14:10,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:10,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942700123] [2019-11-19 21:14:10,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:10,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942700123] [2019-11-19 21:14:10,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:14:10,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 21:14:10,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121044523] [2019-11-19 21:14:10,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:14:10,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:14:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:14:10,714 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-11-19 21:14:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:11,122 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-11-19 21:14:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:14:11,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 21:14:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:11,124 INFO L225 Difference]: With dead ends: 81 [2019-11-19 21:14:11,125 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 21:14:11,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:14:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 21:14:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2019-11-19 21:14:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 21:14:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-19 21:14:11,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2019-11-19 21:14:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:11,133 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-19 21:14:11,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:14:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-19 21:14:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 21:14:11,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:11,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:11,135 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2019-11-19 21:14:11,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:11,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146135500] [2019-11-19 21:14:11,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:11,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146135500] [2019-11-19 21:14:11,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:14:11,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 21:14:11,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201754635] [2019-11-19 21:14:11,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:14:11,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:14:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:14:11,301 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-11-19 21:14:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:11,838 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-19 21:14:11,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:14:11,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 21:14:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:11,840 INFO L225 Difference]: With dead ends: 73 [2019-11-19 21:14:11,840 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 21:14:11,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:14:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 21:14:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2019-11-19 21:14:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 21:14:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-19 21:14:11,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-11-19 21:14:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:11,847 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-19 21:14:11,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:14:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-19 21:14:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:14:11,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:11,848 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:11,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2019-11-19 21:14:11,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:11,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168882882] [2019-11-19 21:14:11,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:12,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168882882] [2019-11-19 21:14:12,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646585205] [2019-11-19 21:14:12,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:12,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 21:14:12,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:14:12,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:14:12,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:12,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:12,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:12,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:12,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:14:12,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:14:12,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-19 21:14:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:12,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:14:12,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-19 21:14:12,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814195668] [2019-11-19 21:14:12,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 21:14:12,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 21:14:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-19 21:14:12,515 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 22 states. [2019-11-19 21:14:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:13,584 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-19 21:14:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 21:14:13,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-19 21:14:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:13,590 INFO L225 Difference]: With dead ends: 77 [2019-11-19 21:14:13,591 INFO L226 Difference]: Without dead ends: 72 [2019-11-19 21:14:13,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 21:14:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-19 21:14:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2019-11-19 21:14:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 21:14:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-19 21:14:13,600 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-11-19 21:14:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:13,601 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-19 21:14:13,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 21:14:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-19 21:14:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:14:13,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:13,602 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:13,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:13,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -949600503, now seen corresponding path program 1 times [2019-11-19 21:14:13,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:13,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157308765] [2019-11-19 21:14:13,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:14,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157308765] [2019-11-19 21:14:14,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074388452] [2019-11-19 21:14:14,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:14,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 21:14:14,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:14:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:14:14,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:14,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:14,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:14,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:14,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:14:14,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:14:14,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-19 21:14:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:14,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:14:14,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-19 21:14:14,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829485539] [2019-11-19 21:14:14,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 21:14:14,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 21:14:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-19 21:14:14,394 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 22 states. [2019-11-19 21:14:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:15,692 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-19 21:14:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 21:14:15,694 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-19 21:14:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:15,695 INFO L225 Difference]: With dead ends: 81 [2019-11-19 21:14:15,695 INFO L226 Difference]: Without dead ends: 76 [2019-11-19 21:14:15,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 21:14:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-19 21:14:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2019-11-19 21:14:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:14:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-19 21:14:15,713 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-11-19 21:14:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:15,714 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-19 21:14:15,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 21:14:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-19 21:14:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 21:14:15,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:15,716 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:15,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:15,917 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2019-11-19 21:14:15,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:15,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154149282] [2019-11-19 21:14:15,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:16,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154149282] [2019-11-19 21:14:16,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866904768] [2019-11-19 21:14:16,130 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:16,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:14:16,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:14:16,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-19 21:14:16,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:14:16,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:14:16,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:16,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:16,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:16,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:16,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:14:16,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:14:16,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-19 21:14:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:16,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:14:16,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-19 21:14:16,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956642281] [2019-11-19 21:14:16,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 21:14:16,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 21:14:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:14:16,505 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 24 states. [2019-11-19 21:14:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:17,918 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-19 21:14:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-19 21:14:17,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-11-19 21:14:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:17,920 INFO L225 Difference]: With dead ends: 85 [2019-11-19 21:14:17,920 INFO L226 Difference]: Without dead ends: 80 [2019-11-19 21:14:17,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-11-19 21:14:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-19 21:14:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 37. [2019-11-19 21:14:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 21:14:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-19 21:14:17,931 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2019-11-19 21:14:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:17,932 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-19 21:14:17,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 21:14:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-19 21:14:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 21:14:17,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:17,933 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:18,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:18,138 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash -523217426, now seen corresponding path program 2 times [2019-11-19 21:14:18,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:18,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015305337] [2019-11-19 21:14:18,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:18,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015305337] [2019-11-19 21:14:18,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402822526] [2019-11-19 21:14:18,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:18,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:14:18,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:14:18,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-19 21:14:18,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:14:18,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:14:18,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:18,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:18,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-19 21:14:18,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:14:18,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:14:18,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:14:18,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-19 21:14:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:18,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:14:18,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-19 21:14:18,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420585583] [2019-11-19 21:14:18,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 21:14:18,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 21:14:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:14:18,792 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 24 states. [2019-11-19 21:14:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:20,274 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-11-19 21:14:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-19 21:14:20,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-11-19 21:14:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:20,282 INFO L225 Difference]: With dead ends: 89 [2019-11-19 21:14:20,282 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 21:14:20,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-11-19 21:14:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 21:14:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-11-19 21:14:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 21:14:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-19 21:14:20,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-11-19 21:14:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:20,301 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-19 21:14:20,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 21:14:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-19 21:14:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 21:14:20,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:20,306 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:20,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:20,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2019-11-19 21:14:20,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:20,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471135153] [2019-11-19 21:14:20,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:20,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471135153] [2019-11-19 21:14:20,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102964545] [2019-11-19 21:14:20,771 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:20,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 21:14:20,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:14:20,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-19 21:14:20,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:14:21,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:14:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:14:21,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:14:21,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-19 21:14:21,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536391543] [2019-11-19 21:14:21,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-19 21:14:21,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-19 21:14:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-11-19 21:14:21,264 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-19 21:14:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:24,212 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-11-19 21:14:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-19 21:14:24,216 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-19 21:14:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:24,217 INFO L225 Difference]: With dead ends: 89 [2019-11-19 21:14:24,217 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 21:14:24,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=866, Invalid=3690, Unknown=0, NotChecked=0, Total=4556 [2019-11-19 21:14:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 21:14:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-19 21:14:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 21:14:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-19 21:14:24,225 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-11-19 21:14:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:24,225 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 21:14:24,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-19 21:14:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-19 21:14:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 21:14:24,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:14:24,226 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:14:24,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:24,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:14:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:14:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 3 times [2019-11-19 21:14:24,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:14:24,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497130617] [2019-11-19 21:14:24,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:14:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:14:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:14:24,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497130617] [2019-11-19 21:14:24,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196146342] [2019-11-19 21:14:24,697 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:24,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 21:14:24,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:14:24,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-19 21:14:24,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:14:25,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:14:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:14:25,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:14:25,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-19 21:14:25,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812556727] [2019-11-19 21:14:25,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-19 21:14:25,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:14:25,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-19 21:14:25,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-11-19 21:14:25,248 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 30 states. [2019-11-19 21:14:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:14:27,958 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-19 21:14:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-19 21:14:27,958 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-19 21:14:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:14:27,959 INFO L225 Difference]: With dead ends: 49 [2019-11-19 21:14:27,959 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:14:27,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=804, Invalid=3356, Unknown=0, NotChecked=0, Total=4160 [2019-11-19 21:14:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:14:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:14:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:14:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:14:27,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-19 21:14:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:14:27,962 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:14:27,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-19 21:14:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:14:27,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:14:28,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:14:28,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:14:28,367 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-19 21:14:28,507 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-19 21:14:29,405 WARN L191 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-11-19 21:14:29,899 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 27 [2019-11-19 21:14:31,084 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 154 DAG size of output: 33 [2019-11-19 21:14:31,129 INFO L444 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-11-19 21:14:31,129 INFO L444 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-11-19 21:14:31,130 INFO L440 ceAbstractionStarter]: At program point L27(lines 25 28) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) ULTIMATE.start_main_~pd2~0.offset))) (let ((.cse5 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse0 (<= .cse10 ULTIMATE.start_main_~i~0)) (.cse3 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse1 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse2 (<= ULTIMATE.start_main_~i~0 .cse10)) (.cse6 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse7 (= 0 |~#d1~0.offset|)) (.cse4 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse8 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset)) (.cse9 (= 1 |ULTIMATE.start_check_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse6 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse8 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse9) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse5 .cse0 .cse3 .cse1 .cse2 .cse6 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse4 .cse8 .cse9)))) [2019-11-19 21:14:31,130 INFO L444 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-11-19 21:14:31,130 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:14:31,131 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:14:31,131 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:14:31,131 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-19 21:14:31,131 INFO L447 ceAbstractionStarter]: At program point L49(lines 30 50) the Hoare annotation is: true [2019-11-19 21:14:31,131 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-19 21:14:31,132 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:14:31,132 INFO L440 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: false [2019-11-19 21:14:31,132 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-11-19 21:14:31,132 INFO L440 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse2 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse3 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse5 (= 0 |~#d1~0.offset|)) (.cse4 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse6 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset)) (.cse7 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (= 0 |~#d2~0.offset|) .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse5 .cse6 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse7) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse5 .cse4 .cse6 .cse7))) [2019-11-19 21:14:31,132 INFO L444 ceAbstractionStarter]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2019-11-19 21:14:31,132 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-19 21:14:31,132 INFO L444 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2019-11-19 21:14:31,133 INFO L440 ceAbstractionStarter]: At program point L22-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (= 0 |~#d1~0.offset|)) (.cse1 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (or (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (= 0 |~#d2~0.offset|) .cse0 (not .cse1)) (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse0 .cse1))) [2019-11-19 21:14:31,133 INFO L444 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-11-19 21:14:31,133 INFO L444 ceAbstractionStarter]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-11-19 21:14:31,133 INFO L440 ceAbstractionStarter]: At program point L22-7(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset) (or (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) (not (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (and .cse0 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|)))) (and (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse0))) [2019-11-19 21:14:31,133 INFO L444 ceAbstractionStarter]: For program point L22-8(line 22) no Hoare annotation was computed. [2019-11-19 21:14:31,133 INFO L444 ceAbstractionStarter]: For program point L22-10(line 22) no Hoare annotation was computed. [2019-11-19 21:14:31,133 INFO L440 ceAbstractionStarter]: At program point L22-11(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base))) (and (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) (let ((.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|)) (.cse2 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset))) (or (and (not .cse1) (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse2 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (and (and .cse1 .cse2) .cse0))) (= 0 |~#d1~0.offset|)))) [2019-11-19 21:14:31,133 INFO L444 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-19 21:14:31,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:14:31 BoogieIcfgContainer [2019-11-19 21:14:31,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:14:31,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:14:31,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:14:31,170 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:14:31,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:14:08" (3/4) ... [2019-11-19 21:14:31,175 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:14:31,188 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 21:14:31,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 21:14:31,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:14:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) [2019-11-19 21:14:31,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == pd1 && 0 == d1) && 0 == pd1) && (((d2 == \result && pd1 == d2) && !(pd1 == d1)) || (!(d1 == d2) && d1 == \result))) || (!(pd1 == \result) && !(d1 == d2)) [2019-11-19 21:14:31,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((unknown-#memory_int-unknown[pd2][pd2] <= i && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && !(d1 == d2)) && pd2 == pa) && pd1 == pd2) && d2 == pd1) && pd2 == pd1) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && 1 == \result) || (((((((((((pd1 == d1 && pd1 == pd2) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(d1 == d2)) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && 1 == \result) [2019-11-19 21:14:31,278 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:14:31,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:14:31,280 INFO L168 Benchmark]: Toolchain (without parser) took 23415.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.1 MB). Free memory was 960.4 MB in the beginning and 917.3 MB in the end (delta: 43.0 MB). Peak memory consumption was 456.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:14:31,280 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:14:31,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.98 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:14:31,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:14:31,281 INFO L168 Benchmark]: Boogie Preprocessor took 43.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:14:31,282 INFO L168 Benchmark]: RCFGBuilder took 380.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:14:31,284 INFO L168 Benchmark]: TraceAbstraction took 22516.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 290.5 MB). Free memory was 1.1 GB in the beginning and 917.3 MB in the end (delta: 174.5 MB). Peak memory consumption was 520.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:14:31,284 INFO L168 Benchmark]: Witness Printer took 108.04 ms. Allocated memory is still 1.4 GB. Free memory is still 917.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:14:31,286 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.98 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22516.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 290.5 MB). Free memory was 1.1 GB in the beginning and 917.3 MB in the end (delta: 174.5 MB). Peak memory consumption was 520.6 MB. Max. memory is 11.5 GB. * Witness Printer took 108.04 ms. Allocated memory is still 1.4 GB. Free memory is still 917.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((\result == pd1 && 0 == d1) && 0 == pd1) && (((d2 == \result && pd1 == d2) && !(pd1 == d1)) || (!(d1 == d2) && d1 == \result))) || (!(pd1 == \result) && !(d1 == d2)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(d1 == d2) && !(pd1 == pd2)) || ((d1 == pd1 && ((((!(pd1 == d1) && d2 == pd1) && pd2 == pd1) && pd1 == d2) || ((pd1 == d1 && pd2 == pd1) && !(d1 == d2)))) && 0 == d1) - InvariantResult [Line: 25]: Loop Invariant [2019-11-19 21:14:31,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,316 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((unknown-#memory_int-unknown[pd2][pd2] <= i && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && !(d1 == d2)) && pd2 == pa) && pd1 == pd2) && d2 == pd1) && pd2 == pd1) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && 1 == \result) || (((((((((((pd1 == d1 && pd1 == pd2) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(d1 == d2)) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && 1 == \result) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) - InvariantResult [Line: 38]: Loop Invariant [2019-11-19 21:14:31,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,329 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 21:14:31,329 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((pd1 == pd2 && 0 == d2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && pd2 == pd1) && pd2 == pa) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) && !(d1 == d2)) || (((((((((pd1 == d1 && pd1 == pd2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) && !(d1 == d2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 22.4s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, HoareTripleCheckerStatistics: 276 SDtfs, 1048 SDslu, 2027 SDs, 0 SdLazy, 3238 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 363 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 43 NumberOfFragments, 294 HoareAnnotationTreeSize, 7 FomulaSimplifications, 6764557 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 573070 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 387 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 53785 SizeOfPredicates, 70 NumberOfNonLiveVariables, 764 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 18/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...