/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/ssh-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:31,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:31,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:31,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:31,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:31,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:31,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:31,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:31,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:31,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:31,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:31,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:31,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:31,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:31,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:31,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:31,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:31,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:31,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:31,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:31,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:31,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:31,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:31,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:31,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:31,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:31,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:31,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:31,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:31,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:31,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:31,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:31,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:31,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:31,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:31,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:31,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:31,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:31,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:31,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:31,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:31,681 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 22:47:31,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:31,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:31,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:31,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:31,708 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:31,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:31,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:31,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:31,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:31,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:31,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:31,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:31,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:31,711 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:31,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:31,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:31,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:31,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:31,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:31,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:31,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:31,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:31,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:31,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:31,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:31,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:31,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:31,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:31,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:31,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:31,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:32,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:32,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:32,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:32,008 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:32,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-23 22:47:32,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86aaf8f/14b2e08de57f48728e37d7b7f546814d/FLAGe71e1f681 [2019-11-23 22:47:32,618 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:32,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-23 22:47:32,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86aaf8f/14b2e08de57f48728e37d7b7f546814d/FLAGe71e1f681 [2019-11-23 22:47:32,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86aaf8f/14b2e08de57f48728e37d7b7f546814d [2019-11-23 22:47:32,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:32,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:32,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:32,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:32,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:32,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:32" (1/1) ... [2019-11-23 22:47:32,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6fa42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:32, skipping insertion in model container [2019-11-23 22:47:32,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:32" (1/1) ... [2019-11-23 22:47:32,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:33,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:33,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:33,289 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:33,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:33,444 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:47:33,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33 WrapperNode [2019-11-23 22:47:33,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:33,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:33,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:47:33,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:47:33,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:33,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:47:33,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:47:33,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:47:33,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (1/1) ... [2019-11-23 22:47:33,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:47:33,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:47:33,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:47:33,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:47:33,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (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 22:47:33,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:47:33,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:47:33,718 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:47:34,293 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:47:34,294 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:47:34,295 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:47:34,296 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:47:34,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:34 BoogieIcfgContainer [2019-11-23 22:47:34,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:47:34,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:47:34,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:47:34,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:47:34,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:32" (1/3) ... [2019-11-23 22:47:34,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467328bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:34, skipping insertion in model container [2019-11-23 22:47:34,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:33" (2/3) ... [2019-11-23 22:47:34,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467328bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:34, skipping insertion in model container [2019-11-23 22:47:34,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:34" (3/3) ... [2019-11-23 22:47:34,306 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-23 22:47:34,317 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:47:34,326 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:47:34,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:47:34,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:47:34,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:47:34,371 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:47:34,371 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:47:34,371 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:47:34,371 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:47:34,372 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:47:34,372 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:47:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-23 22:47:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:47:34,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:34,412 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, 1, 1, 1] [2019-11-23 22:47:34,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-23 22:47:34,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:34,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091362480] [2019-11-23 22:47:34,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:34,590 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 22:47:34,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091362480] [2019-11-23 22:47:34,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:34,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:34,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51372747] [2019-11-23 22:47:34,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:34,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:34,613 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-11-23 22:47:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:34,871 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-23 22:47:34,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:34,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:47:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:34,887 INFO L225 Difference]: With dead ends: 243 [2019-11-23 22:47:34,888 INFO L226 Difference]: Without dead ends: 111 [2019-11-23 22:47:34,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-23 22:47:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-23 22:47:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 22:47:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-23 22:47:34,968 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-23 22:47:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:34,969 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-23 22:47:34,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-23 22:47:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:47:34,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:34,976 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:34,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-23 22:47:34,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:34,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274990885] [2019-11-23 22:47:34,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:47:35,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274990885] [2019-11-23 22:47:35,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:35,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:35,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247581589] [2019-11-23 22:47:35,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:35,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,107 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-23 22:47:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:35,299 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions. [2019-11-23 22:47:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:35,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-23 22:47:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:35,301 INFO L225 Difference]: With dead ends: 231 [2019-11-23 22:47:35,303 INFO L226 Difference]: Without dead ends: 129 [2019-11-23 22:47:35,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-23 22:47:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-23 22:47:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-23 22:47:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-23 22:47:35,323 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-23 22:47:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:35,324 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-23 22:47:35,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-23 22:47:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:47:35,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:35,327 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:35,328 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times [2019-11-23 22:47:35,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:35,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779263305] [2019-11-23 22:47:35,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:47:35,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779263305] [2019-11-23 22:47:35,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:35,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:35,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973817489] [2019-11-23 22:47:35,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:35,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,404 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-23 22:47:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:35,581 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-23 22:47:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:35,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:47:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:35,584 INFO L225 Difference]: With dead ends: 265 [2019-11-23 22:47:35,584 INFO L226 Difference]: Without dead ends: 148 [2019-11-23 22:47:35,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-23 22:47:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-11-23 22:47:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-23 22:47:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-23 22:47:35,613 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-23 22:47:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:35,618 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-23 22:47:35,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-23 22:47:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:47:35,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:35,623 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:35,624 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times [2019-11-23 22:47:35,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:35,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764618255] [2019-11-23 22:47:35,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:47:35,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764618255] [2019-11-23 22:47:35,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:35,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:35,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358320641] [2019-11-23 22:47:35,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:35,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,741 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-23 22:47:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:35,956 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2019-11-23 22:47:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:35,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:47:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:35,959 INFO L225 Difference]: With dead ends: 327 [2019-11-23 22:47:35,959 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 22:47:35,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 22:47:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2019-11-23 22:47:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-23 22:47:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2019-11-23 22:47:35,973 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66 [2019-11-23 22:47:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:35,974 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2019-11-23 22:47:35,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2019-11-23 22:47:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:47:35,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:35,976 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:35,976 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times [2019-11-23 22:47:35,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:35,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796344717] [2019-11-23 22:47:35,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:47:36,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796344717] [2019-11-23 22:47:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342921655] [2019-11-23 22:47:36,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,067 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2019-11-23 22:47:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:36,222 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions. [2019-11-23 22:47:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:36,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:47:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:36,224 INFO L225 Difference]: With dead ends: 382 [2019-11-23 22:47:36,225 INFO L226 Difference]: Without dead ends: 207 [2019-11-23 22:47:36,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-23 22:47:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-23 22:47:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-23 22:47:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2019-11-23 22:47:36,235 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66 [2019-11-23 22:47:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:36,236 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2019-11-23 22:47:36,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2019-11-23 22:47:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:47:36,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:36,238 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:36,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times [2019-11-23 22:47:36,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:36,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620182846] [2019-11-23 22:47:36,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 22:47:36,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620182846] [2019-11-23 22:47:36,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866247374] [2019-11-23 22:47:36,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,339 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states. [2019-11-23 22:47:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:36,469 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions. [2019-11-23 22:47:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:36,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-23 22:47:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:36,472 INFO L225 Difference]: With dead ends: 421 [2019-11-23 22:47:36,472 INFO L226 Difference]: Without dead ends: 227 [2019-11-23 22:47:36,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-23 22:47:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-23 22:47:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-23 22:47:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2019-11-23 22:47:36,489 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82 [2019-11-23 22:47:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:36,490 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2019-11-23 22:47:36,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2019-11-23 22:47:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:47:36,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:36,497 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:36,497 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:36,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times [2019-11-23 22:47:36,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:36,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263417090] [2019-11-23 22:47:36,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:47:36,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263417090] [2019-11-23 22:47:36,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031402188] [2019-11-23 22:47:36,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,625 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states. [2019-11-23 22:47:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:36,673 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2019-11-23 22:47:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:36,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:47:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:36,677 INFO L225 Difference]: With dead ends: 652 [2019-11-23 22:47:36,677 INFO L226 Difference]: Without dead ends: 437 [2019-11-23 22:47:36,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-23 22:47:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-23 22:47:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-23 22:47:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2019-11-23 22:47:36,692 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102 [2019-11-23 22:47:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:36,693 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2019-11-23 22:47:36,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2019-11-23 22:47:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:47:36,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:36,695 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:36,695 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times [2019-11-23 22:47:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:36,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646253842] [2019-11-23 22:47:36,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 22:47:36,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646253842] [2019-11-23 22:47:36,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643178327] [2019-11-23 22:47:36,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,751 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states. [2019-11-23 22:47:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:36,792 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions. [2019-11-23 22:47:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:36,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:47:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:36,796 INFO L225 Difference]: With dead ends: 652 [2019-11-23 22:47:36,797 INFO L226 Difference]: Without dead ends: 650 [2019-11-23 22:47:36,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-23 22:47:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-23 22:47:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-23 22:47:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions. [2019-11-23 22:47:36,816 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104 [2019-11-23 22:47:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions. [2019-11-23 22:47:36,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions. [2019-11-23 22:47:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:47:36,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:36,819 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:36,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times [2019-11-23 22:47:36,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:36,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916085834] [2019-11-23 22:47:36,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 22:47:36,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916085834] [2019-11-23 22:47:36,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:36,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:36,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695722795] [2019-11-23 22:47:36,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:36,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:36,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:36,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:36,920 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states. [2019-11-23 22:47:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:37,104 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions. [2019-11-23 22:47:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:37,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:47:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:37,109 INFO L225 Difference]: With dead ends: 1441 [2019-11-23 22:47:37,110 INFO L226 Difference]: Without dead ends: 797 [2019-11-23 22:47:37,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-23 22:47:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767. [2019-11-23 22:47:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-23 22:47:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions. [2019-11-23 22:47:37,136 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158 [2019-11-23 22:47:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:37,137 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions. [2019-11-23 22:47:37,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions. [2019-11-23 22:47:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-23 22:47:37,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:37,143 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:37,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times [2019-11-23 22:47:37,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:37,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414916550] [2019-11-23 22:47:37,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-23 22:47:37,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414916550] [2019-11-23 22:47:37,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:37,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:37,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080828496] [2019-11-23 22:47:37,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:37,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,217 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states. [2019-11-23 22:47:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:37,424 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions. [2019-11-23 22:47:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:37,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-23 22:47:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:37,431 INFO L225 Difference]: With dead ends: 1803 [2019-11-23 22:47:37,431 INFO L226 Difference]: Without dead ends: 994 [2019-11-23 22:47:37,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-23 22:47:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2019-11-23 22:47:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-23 22:47:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions. [2019-11-23 22:47:37,461 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184 [2019-11-23 22:47:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:37,461 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions. [2019-11-23 22:47:37,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions. [2019-11-23 22:47:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 22:47:37,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:37,466 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:37,466 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times [2019-11-23 22:47:37,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:37,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618010849] [2019-11-23 22:47:37,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-23 22:47:37,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618010849] [2019-11-23 22:47:37,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:37,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:37,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531089381] [2019-11-23 22:47:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:37,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,534 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states. [2019-11-23 22:47:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:37,739 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions. [2019-11-23 22:47:37,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:37,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-23 22:47:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:37,745 INFO L225 Difference]: With dead ends: 2059 [2019-11-23 22:47:37,745 INFO L226 Difference]: Without dead ends: 1067 [2019-11-23 22:47:37,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-23 22:47:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2019-11-23 22:47:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-11-23 22:47:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions. [2019-11-23 22:47:37,780 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205 [2019-11-23 22:47:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:37,780 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions. [2019-11-23 22:47:37,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions. [2019-11-23 22:47:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 22:47:37,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:37,785 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:37,786 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:37,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times [2019-11-23 22:47:37,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:37,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688828014] [2019-11-23 22:47:37,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-23 22:47:37,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688828014] [2019-11-23 22:47:37,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:37,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:37,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809869239] [2019-11-23 22:47:37,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:37,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:37,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:37,910 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states. [2019-11-23 22:47:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:38,100 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions. [2019-11-23 22:47:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:38,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-23 22:47:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:38,106 INFO L225 Difference]: With dead ends: 2209 [2019-11-23 22:47:38,107 INFO L226 Difference]: Without dead ends: 1148 [2019-11-23 22:47:38,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-23 22:47:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115. [2019-11-23 22:47:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-23 22:47:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions. [2019-11-23 22:47:38,139 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229 [2019-11-23 22:47:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:38,139 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions. [2019-11-23 22:47:38,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions. [2019-11-23 22:47:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 22:47:38,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:38,144 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:38,144 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times [2019-11-23 22:47:38,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:38,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226572255] [2019-11-23 22:47:38,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-23 22:47:38,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226572255] [2019-11-23 22:47:38,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:38,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:38,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352620850] [2019-11-23 22:47:38,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:38,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:38,234 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states. [2019-11-23 22:47:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:38,406 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions. [2019-11-23 22:47:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:38,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-23 22:47:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:38,415 INFO L225 Difference]: With dead ends: 2377 [2019-11-23 22:47:38,416 INFO L226 Difference]: Without dead ends: 1244 [2019-11-23 22:47:38,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-23 22:47:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2019-11-23 22:47:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-23 22:47:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions. [2019-11-23 22:47:38,465 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229 [2019-11-23 22:47:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:38,466 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions. [2019-11-23 22:47:38,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions. [2019-11-23 22:47:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-23 22:47:38,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:38,475 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:38,476 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times [2019-11-23 22:47:38,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:38,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784520927] [2019-11-23 22:47:38,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-23 22:47:38,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784520927] [2019-11-23 22:47:38,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:38,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:38,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222677210] [2019-11-23 22:47:38,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:38,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:38,608 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states. [2019-11-23 22:47:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:38,821 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions. [2019-11-23 22:47:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:38,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-23 22:47:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:38,829 INFO L225 Difference]: With dead ends: 2560 [2019-11-23 22:47:38,829 INFO L226 Difference]: Without dead ends: 1346 [2019-11-23 22:47:38,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-23 22:47:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313. [2019-11-23 22:47:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-11-23 22:47:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions. [2019-11-23 22:47:38,872 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259 [2019-11-23 22:47:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:38,873 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions. [2019-11-23 22:47:38,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions. [2019-11-23 22:47:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-23 22:47:38,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:38,880 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:38,880 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times [2019-11-23 22:47:38,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:38,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935903793] [2019-11-23 22:47:38,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-23 22:47:39,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935903793] [2019-11-23 22:47:39,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:39,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:39,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481542723] [2019-11-23 22:47:39,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:39,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:39,008 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states. [2019-11-23 22:47:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:39,196 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions. [2019-11-23 22:47:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:39,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-23 22:47:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:39,203 INFO L225 Difference]: With dead ends: 2656 [2019-11-23 22:47:39,204 INFO L226 Difference]: Without dead ends: 1343 [2019-11-23 22:47:39,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-23 22:47:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310. [2019-11-23 22:47:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-23 22:47:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions. [2019-11-23 22:47:39,239 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294 [2019-11-23 22:47:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:39,239 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions. [2019-11-23 22:47:39,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions. [2019-11-23 22:47:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-23 22:47:39,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:39,245 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:39,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times [2019-11-23 22:47:39,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:39,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417874553] [2019-11-23 22:47:39,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:39,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417874553] [2019-11-23 22:47:39,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:39,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:39,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595209438] [2019-11-23 22:47:39,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:39,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:39,373 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states. [2019-11-23 22:47:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:39,537 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions. [2019-11-23 22:47:39,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:39,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-11-23 22:47:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:39,544 INFO L225 Difference]: With dead ends: 2638 [2019-11-23 22:47:39,544 INFO L226 Difference]: Without dead ends: 1337 [2019-11-23 22:47:39,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-23 22:47:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310. [2019-11-23 22:47:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-23 22:47:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions. [2019-11-23 22:47:39,582 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304 [2019-11-23 22:47:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:39,583 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions. [2019-11-23 22:47:39,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions. [2019-11-23 22:47:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-23 22:47:39,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:39,590 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:39,590 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times [2019-11-23 22:47:39,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:39,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063589381] [2019-11-23 22:47:39,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:39,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063589381] [2019-11-23 22:47:39,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:39,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:39,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950371067] [2019-11-23 22:47:39,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:39,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:39,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:39,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:39,731 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states. [2019-11-23 22:47:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:39,918 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions. [2019-11-23 22:47:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:39,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-23 22:47:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:39,926 INFO L225 Difference]: With dead ends: 2761 [2019-11-23 22:47:39,926 INFO L226 Difference]: Without dead ends: 1460 [2019-11-23 22:47:39,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-23 22:47:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355. [2019-11-23 22:47:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-23 22:47:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions. [2019-11-23 22:47:39,968 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331 [2019-11-23 22:47:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:39,968 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions. [2019-11-23 22:47:39,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions. [2019-11-23 22:47:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-23 22:47:39,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:39,975 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:39,975 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times [2019-11-23 22:47:39,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:39,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835194272] [2019-11-23 22:47:39,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-23 22:47:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835194272] [2019-11-23 22:47:40,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:40,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:40,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722919424] [2019-11-23 22:47:40,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:40,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,209 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states. [2019-11-23 22:47:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:40,270 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions. [2019-11-23 22:47:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:40,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-23 22:47:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:40,286 INFO L225 Difference]: With dead ends: 3852 [2019-11-23 22:47:40,287 INFO L226 Difference]: Without dead ends: 2506 [2019-11-23 22:47:40,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-23 22:47:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-23 22:47:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-23 22:47:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions. [2019-11-23 22:47:40,379 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332 [2019-11-23 22:47:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:40,380 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions. [2019-11-23 22:47:40,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions. [2019-11-23 22:47:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-23 22:47:40,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:40,388 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:40,389 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times [2019-11-23 22:47:40,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:40,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391324272] [2019-11-23 22:47:40,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391324272] [2019-11-23 22:47:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217225748] [2019-11-23 22:47:40,582 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 22:47:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:40,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:47:40,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-23 22:47:41,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:41,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:41,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674909176] [2019-11-23 22:47:41,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:41,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:41,206 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states. [2019-11-23 22:47:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:41,279 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions. [2019-11-23 22:47:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:41,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-11-23 22:47:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:41,298 INFO L225 Difference]: With dead ends: 5826 [2019-11-23 22:47:41,298 INFO L226 Difference]: Without dead ends: 3331 [2019-11-23 22:47:41,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-11-23 22:47:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2019-11-23 22:47:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-11-23 22:47:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions. [2019-11-23 22:47:41,405 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342 [2019-11-23 22:47:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:41,406 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions. [2019-11-23 22:47:41,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions. [2019-11-23 22:47:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-23 22:47:41,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:41,415 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:41,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:41,623 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times [2019-11-23 22:47:41,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:41,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372557482] [2019-11-23 22:47:41,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:41,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372557482] [2019-11-23 22:47:41,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213459107] [2019-11-23 22:47:41,890 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 22:47:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:42,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:42,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-23 22:47:42,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:42,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:42,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044109366] [2019-11-23 22:47:42,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:42,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:42,290 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states. [2019-11-23 22:47:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,866 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions. [2019-11-23 22:47:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:47:42,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-23 22:47:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,890 INFO L225 Difference]: With dead ends: 6603 [2019-11-23 22:47:42,891 INFO L226 Difference]: Without dead ends: 4983 [2019-11-23 22:47:42,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-11-23 22:47:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683. [2019-11-23 22:47:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-11-23 22:47:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions. [2019-11-23 22:47:43,022 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344 [2019-11-23 22:47:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:43,023 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions. [2019-11-23 22:47:43,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions. [2019-11-23 22:47:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-23 22:47:43,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:43,032 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:43,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:43,246 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times [2019-11-23 22:47:43,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:43,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054938823] [2019-11-23 22:47:43,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:43,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054938823] [2019-11-23 22:47:43,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337516317] [2019-11-23 22:47:43,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 22:47:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:43,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:43,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:43,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:43,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:43,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069277184] [2019-11-23 22:47:43,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:43,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:43,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:43,809 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states. [2019-11-23 22:47:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:44,167 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions. [2019-11-23 22:47:44,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:44,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-23 22:47:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:44,207 INFO L225 Difference]: With dead ends: 8481 [2019-11-23 22:47:44,207 INFO L226 Difference]: Without dead ends: 4798 [2019-11-23 22:47:44,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2019-11-23 22:47:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841. [2019-11-23 22:47:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2019-11-23 22:47:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions. [2019-11-23 22:47:44,339 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370 [2019-11-23 22:47:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:44,340 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions. [2019-11-23 22:47:44,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions. [2019-11-23 22:47:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-23 22:47:44,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:44,351 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:44,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:44,556 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times [2019-11-23 22:47:44,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:44,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138693633] [2019-11-23 22:47:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-23 22:47:44,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138693633] [2019-11-23 22:47:44,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:44,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:44,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747109210] [2019-11-23 22:47:44,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:44,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,773 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states. [2019-11-23 22:47:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:44,979 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions. [2019-11-23 22:47:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:44,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-23 22:47:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:44,988 INFO L225 Difference]: With dead ends: 7373 [2019-11-23 22:47:44,988 INFO L226 Difference]: Without dead ends: 1985 [2019-11-23 22:47:44,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-23 22:47:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893. [2019-11-23 22:47:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-23 22:47:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions. [2019-11-23 22:47:45,056 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409 [2019-11-23 22:47:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:45,056 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions. [2019-11-23 22:47:45,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions. [2019-11-23 22:47:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-23 22:47:45,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:45,067 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:45,068 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:45,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times [2019-11-23 22:47:45,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:45,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107047172] [2019-11-23 22:47:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-23 22:47:45,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107047172] [2019-11-23 22:47:45,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710299619] [2019-11-23 22:47:45,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 22:47:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:45,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:47:45,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2019-11-23 22:47:45,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:45,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:45,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595742767] [2019-11-23 22:47:45,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:45,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:45,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:45,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:45,623 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states. [2019-11-23 22:47:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:45,859 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions. [2019-11-23 22:47:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:45,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-23 22:47:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:45,865 INFO L225 Difference]: With dead ends: 3956 [2019-11-23 22:47:45,865 INFO L226 Difference]: Without dead ends: 1991 [2019-11-23 22:47:45,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-23 22:47:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-11-23 22:47:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-23 22:47:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions. [2019-11-23 22:47:45,937 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493 [2019-11-23 22:47:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:45,938 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions. [2019-11-23 22:47:45,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions. [2019-11-23 22:47:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-23 22:47:45,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:45,951 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:46,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:46,160 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times [2019-11-23 22:47:46,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:46,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072119550] [2019-11-23 22:47:46,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-11-23 22:47:46,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072119550] [2019-11-23 22:47:46,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331449563] [2019-11-23 22:47:46,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 22:47:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:46,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:46,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-23 22:47:46,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:46,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:46,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262529409] [2019-11-23 22:47:46,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:46,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:46,964 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states. [2019-11-23 22:47:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:47,006 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions. [2019-11-23 22:47:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:47,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-23 22:47:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:47,014 INFO L225 Difference]: With dead ends: 2038 [2019-11-23 22:47:47,015 INFO L226 Difference]: Without dead ends: 1835 [2019-11-23 22:47:47,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-23 22:47:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786. [2019-11-23 22:47:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-23 22:47:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions. [2019-11-23 22:47:47,071 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493 [2019-11-23 22:47:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:47,072 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions. [2019-11-23 22:47:47,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions. [2019-11-23 22:47:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-23 22:47:47,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:47,092 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:47,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:47,297 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:47,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times [2019-11-23 22:47:47,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:47,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636340098] [2019-11-23 22:47:47,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-23 22:47:47,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636340098] [2019-11-23 22:47:47,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814028294] [2019-11-23 22:47:47,666 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 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 22:47:47,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:47:47,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:47:47,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:47,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-23 22:47:48,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:48,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:48,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427095784] [2019-11-23 22:47:48,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:48,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:48,061 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states. [2019-11-23 22:47:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:48,225 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions. [2019-11-23 22:47:48,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:48,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-11-23 22:47:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:48,227 INFO L225 Difference]: With dead ends: 2046 [2019-11-23 22:47:48,227 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:47:48,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:47:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:47:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:47:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:47:48,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-11-23 22:47:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:48,230 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:47:48,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:47:48,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:47:48,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:48,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:47:48,972 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103 [2019-11-23 22:47:49,249 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-11-23 22:47:49,693 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-11-23 22:47:49,969 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-23 22:47:50,081 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-23 22:47:50,809 WARN L192 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-23 22:47:50,909 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-23 22:47:50,909 INFO L444 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-23 22:47:50,909 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-23 22:47:50,909 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-23 22:47:50,910 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-23 22:47:50,910 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-23 22:47:50,910 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-23 22:47:50,910 INFO L444 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,910 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-23 22:47:50,910 INFO L444 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-23 22:47:50,912 INFO L440 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-23 22:47:50,912 INFO L440 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2 .cse3))) [2019-11-23 22:47:50,912 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-23 22:47:50,912 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-23 22:47:50,912 INFO L444 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-23 22:47:50,913 INFO L444 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-23 22:47:50,913 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-23 22:47:50,913 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-23 22:47:50,914 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-23 22:47:50,914 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-23 22:47:50,914 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-23 22:47:50,914 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-23 22:47:50,915 INFO L440 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse0 .cse1 .cse2))) [2019-11-23 22:47:50,916 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-23 22:47:50,917 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-23 22:47:50,918 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-23 22:47:50,918 INFO L444 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,918 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-23 22:47:50,919 INFO L440 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse5 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse4 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse2 .cse3) (and .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-23 22:47:50,919 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-23 22:47:50,919 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-23 22:47:50,919 INFO L447 ceAbstractionStarter]: At program point L607(lines 7 609) the Hoare annotation is: true [2019-11-23 22:47:50,919 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-23 22:47:50,919 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-23 22:47:50,920 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-23 22:47:50,920 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-23 22:47:50,920 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-23 22:47:50,920 INFO L444 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-23 22:47:50,921 INFO L440 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-23 22:47:50,921 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-23 22:47:50,922 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-23 22:47:50,922 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-23 22:47:50,922 INFO L440 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-11-23 22:47:50,922 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-23 22:47:50,922 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-23 22:47:50,922 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-23 22:47:50,923 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-23 22:47:50,923 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-23 22:47:50,923 INFO L444 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-23 22:47:50,923 INFO L440 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse2 .cse3))) [2019-11-23 22:47:50,923 INFO L440 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:50,923 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-23 22:47:50,924 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-23 22:47:50,925 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-23 22:47:50,926 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,926 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-23 22:47:50,926 INFO L440 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and (not .cse0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse4 .cse0 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-23 22:47:50,927 INFO L440 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:50,927 INFO L447 ceAbstractionStarter]: At program point L618(lines 610 620) the Hoare annotation is: true [2019-11-23 22:47:50,927 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-23 22:47:50,927 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-23 22:47:50,927 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-23 22:47:50,927 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-23 22:47:50,927 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-23 22:47:50,927 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:47:50,928 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-23 22:47:50,928 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-23 22:47:50,928 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-23 22:47:50,928 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-23 22:47:50,928 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-23 22:47:50,928 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,929 INFO L440 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 .cse3 .cse4) (and (not .cse3) .cse0 .cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2019-11-23 22:47:50,929 INFO L440 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-23 22:47:50,930 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:47:50,931 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-23 22:47:50,931 INFO L444 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-23 22:47:50,931 INFO L447 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-23 22:47:50,931 INFO L440 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-23 22:47:50,931 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-23 22:47:50,931 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-23 22:47:50,932 INFO L444 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-23 22:47:50,933 INFO L447 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-23 22:47:50,933 INFO L440 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-23 22:47:50,933 INFO L440 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-23 22:47:50,933 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-23 22:47:50,934 INFO L440 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse5 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse1 (not .cse6)) (.cse16 (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse10 .cse5 .cse7) (and .cse0 .cse10 .cse6) (and .cse2 .cse3 .cse0 .cse9 .cse7) (and .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse11 .cse5 .cse6 .cse7) (and .cse14 .cse5 .cse15 .cse9 .cse6 .cse7) (and .cse0 .cse10 .cse7) (and .cse16 .cse4 .cse5 .cse6) (and .cse1 .cse14 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse15) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse16 .cse0 .cse6) (and .cse14 .cse0 .cse15 .cse9 .cse6 .cse7) (and .cse11 .cse0 .cse6 .cse12) (and .cse0 .cse6 .cse8) (and .cse13 .cse11 .cse0)))) [2019-11-23 22:47:50,934 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-23 22:47:50,935 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-23 22:47:50,935 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-23 22:47:50,935 INFO L447 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-23 22:47:50,935 INFO L440 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-23 22:47:50,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:50 BoogieIcfgContainer [2019-11-23 22:47:50,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:50,986 INFO L168 Benchmark]: Toolchain (without parser) took 18040.11 ms. Allocated memory was 146.3 MB in the beginning and 910.7 MB in the end (delta: 764.4 MB). Free memory was 103.3 MB in the beginning and 86.8 MB in the end (delta: 16.5 MB). Peak memory consumption was 780.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,988 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.35 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 103.1 MB in the beginning and 179.0 MB in the end (delta: -75.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.64 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 176.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,991 INFO L168 Benchmark]: Boogie Preprocessor took 45.46 ms. Allocated memory is still 202.9 MB. Free memory was 176.3 MB in the beginning and 174.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,992 INFO L168 Benchmark]: RCFGBuilder took 748.85 ms. Allocated memory is still 202.9 MB. Free memory was 174.4 MB in the beginning and 132.4 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,992 INFO L168 Benchmark]: TraceAbstraction took 16684.71 ms. Allocated memory was 202.9 MB in the beginning and 910.7 MB in the end (delta: 707.8 MB). Free memory was 131.8 MB in the beginning and 86.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 752.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:50,996 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 498.35 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 103.1 MB in the beginning and 179.0 MB in the end (delta: -75.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.64 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 176.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.46 ms. Allocated memory is still 202.9 MB. Free memory was 176.3 MB in the beginning and 174.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.85 ms. Allocated memory is still 202.9 MB. Free memory was 174.4 MB in the beginning and 132.4 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16684.71 ms. Allocated memory was 202.9 MB in the beginning and 910.7 MB in the end (delta: 707.8 MB). Free memory was 131.8 MB in the beginning and 86.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 752.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 118]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((s__state <= 4464 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4464 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((s__state <= 4480 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4480 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((s__state <= 4352 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((s__state <= 4512 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || (((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((s__state <= 4560 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4560 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)) || ((((s__state <= 4560 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__state <= 4352 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((4416 == s__state && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((4416 == s__state && blastFlag <= 2) && 0 == s__hit)) || (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Result: SAFE, OverallTime: 16.5s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3841occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 824 HoareAnnotationTreeSize, 22 FomulaSimplifications, 30206 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24380 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8751 NumberOfCodeBlocks, 8751 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8720 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4110 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39090/39192 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...