/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:56:52,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:56:52,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:56:52,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:56:52,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:56:52,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:56:52,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:56:52,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:56:52,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:56:52,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:56:52,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:56:52,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:56:52,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:56:52,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:56:52,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:56:52,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:56:52,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:56:52,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:56:52,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:56:52,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:56:52,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:56:52,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:56:52,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:56:52,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:56:52,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:56:52,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:56:52,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:56:52,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:56:52,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:56:52,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:56:52,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:56:52,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:56:52,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:56:52,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:56:52,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:56:52,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:56:52,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:56:52,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:56:52,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:56:52,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:56:52,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:56:52,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:56:52,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:56:52,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:56:52,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:56:52,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:56:52,566 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:56:52,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:56:52,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:56:52,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:56:52,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:56:52,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:56:52,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:56:52,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:56:52,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:56:52,571 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:56:52,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:56:52,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:56:52,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:56:52,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:56:52,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:56:52,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:56:52,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:56:52,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:56:52,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:56:52,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:56:52,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:56:52,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:56:52,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:56:52,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:56:52,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:56:52,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:56:52,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:56:52,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:56:52,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:56:52,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:56:52,863 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:56:52,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-1.c [2019-11-23 21:56:52,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391a45bd9/1c799f21f60e4b18a434433135c015a8/FLAGe073615ef [2019-11-23 21:56:53,323 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:56:53,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-1.c [2019-11-23 21:56:53,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391a45bd9/1c799f21f60e4b18a434433135c015a8/FLAGe073615ef [2019-11-23 21:56:53,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391a45bd9/1c799f21f60e4b18a434433135c015a8 [2019-11-23 21:56:53,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:56:53,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:56:53,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:56:53,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:56:53,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:56:53,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:53,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292422ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53, skipping insertion in model container [2019-11-23 21:56:53,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:53,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:56:53,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:56:53,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:56:53,948 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:56:53,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:56:53,985 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:56:53,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53 WrapperNode [2019-11-23 21:56:53,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:56:53,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:56:53,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:56:53,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:56:53,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:56:54,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:56:54,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:56:54,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:56:54,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (1/1) ... [2019-11-23 21:56:54,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:56:54,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:56:54,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:56:54,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:56:54,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (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-23 21:56:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-23 21:56:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 21:56:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:56:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:56:54,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:56:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:56:54,496 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:56:54,496 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-23 21:56:54,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:54 BoogieIcfgContainer [2019-11-23 21:56:54,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:56:54,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:56:54,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:56:54,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:56:54,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:56:53" (1/3) ... [2019-11-23 21:56:54,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e3980d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:54, skipping insertion in model container [2019-11-23 21:56:54,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:53" (2/3) ... [2019-11-23 21:56:54,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e3980d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:54, skipping insertion in model container [2019-11-23 21:56:54,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:54" (3/3) ... [2019-11-23 21:56:54,508 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-11-23 21:56:54,523 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:56:54,532 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:56:54,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:56:54,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:56:54,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:56:54,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:56:54,584 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:56:54,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:56:54,594 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:56:54,594 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:56:54,594 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:56:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-23 21:56:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:56:54,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:54,619 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-23 21:56:54,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2019-11-23 21:56:54,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:54,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245990087] [2019-11-23 21:56:54,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:54,804 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-23 21:56:54,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245990087] [2019-11-23 21:56:54,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:54,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:56:54,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001260697] [2019-11-23 21:56:54,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:56:54,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:56:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:56:54,825 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-23 21:56:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:54,841 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-11-23 21:56:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:56:54,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-23 21:56:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:54,852 INFO L225 Difference]: With dead ends: 34 [2019-11-23 21:56:54,852 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 21:56:54,855 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-23 21:56:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 21:56:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-23 21:56:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 21:56:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 21:56:54,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2019-11-23 21:56:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:54,891 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 21:56:54,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:56:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 21:56:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:56:54,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:54,895 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-23 21:56:54,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:54,897 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2019-11-23 21:56:54,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:54,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384338728] [2019-11-23 21:56:54,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:55,256 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-23 21:56:55,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384338728] [2019-11-23 21:56:55,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:55,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 21:56:55,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610884570] [2019-11-23 21:56:55,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:56:55,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:56:55,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:56:55,263 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-11-23 21:56:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:55,874 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-11-23 21:56:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:56:55,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:56:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:55,877 INFO L225 Difference]: With dead ends: 96 [2019-11-23 21:56:55,877 INFO L226 Difference]: Without dead ends: 91 [2019-11-23 21:56:55,879 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-23 21:56:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-23 21:56:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2019-11-23 21:56:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 21:56:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-23 21:56:55,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-11-23 21:56:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:55,889 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-23 21:56:55,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:56:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-23 21:56:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:56:55,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:55,891 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-23 21:56:55,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2019-11-23 21:56:55,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:55,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628666793] [2019-11-23 21:56:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:56,011 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-23 21:56:56,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628666793] [2019-11-23 21:56:56,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:56,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 21:56:56,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648211264] [2019-11-23 21:56:56,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:56:56,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:56:56,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:56:56,014 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-11-23 21:56:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:56,445 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-23 21:56:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:56:56,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:56:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:56,451 INFO L225 Difference]: With dead ends: 91 [2019-11-23 21:56:56,452 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 21:56:56,453 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-23 21:56:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 21:56:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-11-23 21:56:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 21:56:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-23 21:56:56,470 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-23 21:56:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:56,471 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-23 21:56:56,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:56:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-23 21:56:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:56:56,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:56,473 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-23 21:56:56,473 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:56,474 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2019-11-23 21:56:56,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:56,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516640959] [2019-11-23 21:56:56,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:56,631 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-23 21:56:56,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516640959] [2019-11-23 21:56:56,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:56,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 21:56:56,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513589771] [2019-11-23 21:56:56,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:56:56,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:56,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:56:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:56:56,636 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-11-23 21:56:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:57,036 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-11-23 21:56:57,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:56:57,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:56:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:57,037 INFO L225 Difference]: With dead ends: 81 [2019-11-23 21:56:57,037 INFO L226 Difference]: Without dead ends: 64 [2019-11-23 21:56:57,038 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-23 21:56:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-23 21:56:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2019-11-23 21:56:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 21:56:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-23 21:56:57,045 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2019-11-23 21:56:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:57,045 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-23 21:56:57,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:56:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-23 21:56:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:56:57,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:57,047 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-23 21:56:57,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2019-11-23 21:56:57,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:57,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100012225] [2019-11-23 21:56:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:57,219 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-23 21:56:57,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100012225] [2019-11-23 21:56:57,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:57,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 21:56:57,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623959335] [2019-11-23 21:56:57,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:56:57,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:56:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:56:57,223 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-11-23 21:56:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:57,737 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-23 21:56:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:56:57,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:56:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:57,739 INFO L225 Difference]: With dead ends: 73 [2019-11-23 21:56:57,740 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 21:56:57,740 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-23 21:56:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 21:56:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2019-11-23 21:56:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 21:56:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-23 21:56:57,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-11-23 21:56:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:57,747 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-23 21:56:57,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:56:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-23 21:56:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:56:57,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:57,748 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-23 21:56:57,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2019-11-23 21:56:57,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:57,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394537771] [2019-11-23 21:56:57,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:57,939 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-23 21:56:57,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394537771] [2019-11-23 21:56:57,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004727587] [2019-11-23 21:56:57,941 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-23 21:56:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:58,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 21:56:58,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:56:58,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:56:58,326 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-23 21:56:58,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:56:58,332 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-23 21:56:58,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:56:58,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:56:58,344 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-23 21:56:58,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-23 21:56:58,347 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-23 21:56:58,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:56:58,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-23 21:56:58,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569358445] [2019-11-23 21:56:58,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:56:58,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:58,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:56:58,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:56:58,350 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 22 states. [2019-11-23 21:56:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:59,454 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-23 21:56:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:56:59,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-23 21:56:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:59,455 INFO L225 Difference]: With dead ends: 77 [2019-11-23 21:56:59,456 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 21:56:59,457 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-23 21:56:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 21:56:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2019-11-23 21:56:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 21:56:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-23 21:56:59,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-11-23 21:56:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:59,466 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-23 21:56:59,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:56:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-23 21:56:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:56:59,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:59,467 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-23 21:56:59,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:59,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash -949600503, now seen corresponding path program 1 times [2019-11-23 21:56:59,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:59,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078861554] [2019-11-23 21:56:59,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:59,878 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-23 21:56:59,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078861554] [2019-11-23 21:56:59,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824537693] [2019-11-23 21:56:59,880 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-23 21:56:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:59,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 21:56:59,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:00,185 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-23 21:57:00,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:00,189 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-23 21:57:00,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:00,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:00,200 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-23 21:57:00,200 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-23 21:57:00,203 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-23 21:57:00,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:00,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-23 21:57:00,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748759957] [2019-11-23 21:57:00,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:57:00,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:57:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:57:00,205 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 22 states. [2019-11-23 21:57:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:01,449 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-23 21:57:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:57:01,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-23 21:57:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:01,451 INFO L225 Difference]: With dead ends: 81 [2019-11-23 21:57:01,451 INFO L226 Difference]: Without dead ends: 76 [2019-11-23 21:57:01,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 21:57:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-23 21:57:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2019-11-23 21:57:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:57:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-23 21:57:01,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-11-23 21:57:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:01,459 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-23 21:57:01,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:57:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-23 21:57:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:57:01,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:01,460 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-23 21:57:01,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:01,664 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2019-11-23 21:57:01,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:01,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983550085] [2019-11-23 21:57:01,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:01,928 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-23 21:57:01,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983550085] [2019-11-23 21:57:01,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384443878] [2019-11-23 21:57:01,930 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-23 21:57:02,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:02,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:02,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 21:57:02,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:02,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:02,273 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-23 21:57:02,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:02,278 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-23 21:57:02,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:02,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:02,289 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-23 21:57:02,290 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-23 21:57:02,292 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-23 21:57:02,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:02,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-23 21:57:02,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355155524] [2019-11-23 21:57:02,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:57:02,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:02,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:57:02,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:57:02,294 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 24 states. [2019-11-23 21:57:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:03,668 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-23 21:57:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 21:57:03,669 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-11-23 21:57:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:03,670 INFO L225 Difference]: With dead ends: 85 [2019-11-23 21:57:03,670 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 21:57:03,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 21:57:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 21:57:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 37. [2019-11-23 21:57:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 21:57:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-23 21:57:03,680 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2019-11-23 21:57:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:03,681 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-23 21:57:03,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:57:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-23 21:57:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:57:03,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:03,682 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-23 21:57:03,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:03,891 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -523217426, now seen corresponding path program 2 times [2019-11-23 21:57:03,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:03,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85265582] [2019-11-23 21:57:03,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:04,116 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-23 21:57:04,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85265582] [2019-11-23 21:57:04,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006565731] [2019-11-23 21:57:04,117 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-23 21:57:04,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:04,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:04,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 21:57:04,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:04,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:04,440 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-23 21:57:04,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:04,445 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-23 21:57:04,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:04,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:04,459 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-23 21:57:04,459 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-23 21:57:04,462 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-23 21:57:04,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:04,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-23 21:57:04,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772623288] [2019-11-23 21:57:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:57:04,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:57:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:57:04,465 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 24 states. [2019-11-23 21:57:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:06,030 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-11-23 21:57:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 21:57:06,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-11-23 21:57:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:06,034 INFO L225 Difference]: With dead ends: 89 [2019-11-23 21:57:06,034 INFO L226 Difference]: Without dead ends: 84 [2019-11-23 21:57:06,036 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-23 21:57:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-23 21:57:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-11-23 21:57:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:57:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-23 21:57:06,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-11-23 21:57:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:06,050 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-23 21:57:06,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:57:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-23 21:57:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:57:06,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:06,053 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-23 21:57:06,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:06,264 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2019-11-23 21:57:06,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:06,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525724293] [2019-11-23 21:57:06,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:06,525 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-23 21:57:06,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525724293] [2019-11-23 21:57:06,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984884902] [2019-11-23 21:57:06,526 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-23 21:57:06,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:57:06,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:06,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-23 21:57:06,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:06,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:07,005 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-23 21:57:07,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:07,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-23 21:57:07,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109183127] [2019-11-23 21:57:07,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 21:57:07,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 21:57:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:57:07,007 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-23 21:57:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:10,019 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-11-23 21:57:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 21:57:10,020 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-23 21:57:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:10,020 INFO L225 Difference]: With dead ends: 89 [2019-11-23 21:57:10,020 INFO L226 Difference]: Without dead ends: 44 [2019-11-23 21:57:10,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=866, Invalid=3690, Unknown=0, NotChecked=0, Total=4556 [2019-11-23 21:57:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-23 21:57:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-23 21:57:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 21:57:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-23 21:57:10,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-11-23 21:57:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:10,027 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-23 21:57:10,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 21:57:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-23 21:57:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:57:10,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:10,028 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-23 21:57:10,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:10,231 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 3 times [2019-11-23 21:57:10,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:10,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048810785] [2019-11-23 21:57:10,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:10,459 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-23 21:57:10,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048810785] [2019-11-23 21:57:10,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040192449] [2019-11-23 21:57:10,460 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-23 21:57:10,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:57:10,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:10,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 21:57:10,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:10,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:10,975 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-23 21:57:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-23 21:57:10,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451123445] [2019-11-23 21:57:10,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 21:57:10,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 21:57:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:57:10,978 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 30 states. [2019-11-23 21:57:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:13,752 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-23 21:57:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 21:57:13,753 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-23 21:57:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:13,753 INFO L225 Difference]: With dead ends: 49 [2019-11-23 21:57:13,754 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:57:13,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=804, Invalid=3356, Unknown=0, NotChecked=0, Total=4160 [2019-11-23 21:57:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:57:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:57:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:57:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:57:13,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-23 21:57:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:13,756 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:57:13,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 21:57:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:57:13,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:57:13,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:13,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:57:14,164 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-23 21:57:14,313 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-23 21:57:15,158 WARN L192 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-11-23 21:57:15,286 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-23 21:57:15,720 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 27 [2019-11-23 21:57:16,915 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 154 DAG size of output: 33 [2019-11-23 21:57:16,957 INFO L444 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-11-23 21:57:16,957 INFO L444 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-11-23 21:57:16,958 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-23 21:57:16,958 INFO L444 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-11-23 21:57:16,958 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:57:16,958 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:57:16,958 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:57:16,959 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-23 21:57:16,959 INFO L447 ceAbstractionStarter]: At program point L49(lines 30 50) the Hoare annotation is: true [2019-11-23 21:57:16,959 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-23 21:57:16,959 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:57:16,959 INFO L440 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: false [2019-11-23 21:57:16,959 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-11-23 21:57:16,960 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 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse4 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse6 (= 0 |~#d1~0.offset|)) (.cse5 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse7 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and .cse0 (= 0 |~#d2~0.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_main_~pd1~0.offset) .cse6 .cse7 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse6 .cse5 .cse7))) [2019-11-23 21:57:16,960 INFO L444 ceAbstractionStarter]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2019-11-23 21:57:16,960 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:57:16,960 INFO L444 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2019-11-23 21:57:16,960 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-23 21:57:16,960 INFO L444 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-11-23 21:57:16,960 INFO L444 ceAbstractionStarter]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-11-23 21:57:16,961 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 (or (and .cse0 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|)) (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|)))) (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset)) (and (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse0))) [2019-11-23 21:57:16,961 INFO L444 ceAbstractionStarter]: For program point L22-8(line 22) no Hoare annotation was computed. [2019-11-23 21:57:16,961 INFO L444 ceAbstractionStarter]: For program point L22-10(line 22) no Hoare annotation was computed. [2019-11-23 21:57:16,961 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 (let ((.cse2 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (or (and .cse1 .cse0 .cse2) (and (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse2 (not .cse1) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)))) (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|)))) [2019-11-23 21:57:16,961 INFO L444 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-23 21:57:16,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:16,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:57:16 BoogieIcfgContainer [2019-11-23 21:57:17,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:57:17,001 INFO L168 Benchmark]: Toolchain (without parser) took 23283.80 ms. Allocated memory was 139.5 MB in the beginning and 373.8 MB in the end (delta: 234.4 MB). Free memory was 103.9 MB in the beginning and 166.2 MB in the end (delta: -62.4 MB). Peak memory consumption was 246.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,002 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.63 ms. Allocated memory is still 139.5 MB. Free memory was 103.6 MB in the beginning and 93.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.15 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 93.0 MB in the beginning and 181.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,004 INFO L168 Benchmark]: Boogie Preprocessor took 28.51 ms. Allocated memory is still 203.4 MB. Free memory was 181.3 MB in the beginning and 179.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,005 INFO L168 Benchmark]: RCFGBuilder took 360.24 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 161.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,005 INFO L168 Benchmark]: TraceAbstraction took 22499.88 ms. Allocated memory was 203.4 MB in the beginning and 373.8 MB in the end (delta: 170.4 MB). Free memory was 161.1 MB in the beginning and 166.2 MB in the end (delta: -5.2 MB). Peak memory consumption was 240.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:17,009 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.63 ms. Allocated memory is still 139.5 MB. Free memory was 103.6 MB in the beginning and 93.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 121.15 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 93.0 MB in the beginning and 181.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.51 ms. Allocated memory is still 203.4 MB. Free memory was 181.3 MB in the beginning and 179.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.24 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 161.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22499.88 ms. Allocated memory was 203.4 MB in the beginning and 373.8 MB in the end (delta: 170.4 MB). Free memory was 161.1 MB in the beginning and 166.2 MB in the end (delta: -5.2 MB). Peak memory consumption was 240.1 MB. Max. memory is 7.1 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: (((((!(d1 == d2) && d1 == \result) || ((d2 == \result && pd1 == d2) && !(pd1 == d1))) && \result == pd1) && 0 == d1) && 0 == pd1) || (!(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)) || (((((pd1 == d1 && !(d1 == d2)) && pd2 == pd1) || (((d2 == pd1 && pd2 == pd1) && !(pd1 == d1)) && pd1 == d2)) && d1 == pd1) && 0 == d1) - InvariantResult [Line: 25]: Loop Invariant [2019-11-23 21:57:17,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,024 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,025 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,026 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-23 21:57:17,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:17,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((pd1 == pd2 && 0 == d2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && !(d1 == d2)) && pd2 == pd1) && pd2 == pa) && 0 == pd1) && 0 == d1) && pa == pd2) && pd1 == d2) || (((((((((pd1 == d1 && pd1 == pd2) && i <= unknown-#memory_int-unknown[pa][pa]) && !(0 == pd2)) && !(d1 == d2)) && pd2 == pd1) && d1 == pd1) && 0 == d1) && pd2 == pa) && pa == pd2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 22.3s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, HoareTripleCheckerStatistics: 276 SDtfs, 1048 SDslu, 2027 SDs, 0 SdLazy, 3238 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 12.7s 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, 293 HoareAnnotationTreeSize, 7 FomulaSimplifications, 6766116 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 573071 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s 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...