/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_srvr_13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:01,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:01,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:01,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:01,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:01,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:01,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:01,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:01,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:01,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:01,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:01,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:01,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:01,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:01,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:01,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:01,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:01,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:01,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:01,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:01,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:01,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:01,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:01,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:01,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:01,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:01,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:01,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:01,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:01,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:01,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:01,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:01,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:01,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:01,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:01,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:01,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:01,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:01,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:01,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:01,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:01,540 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:48:01,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:01,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:01,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:01,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:01,577 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:01,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:01,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:01,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:01,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:01,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:01,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:01,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:01,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:01,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:01,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:01,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:01,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:01,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:01,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:01,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:01,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:01,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:01,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:01,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:01,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:01,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:01,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:01,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:01,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:01,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:01,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:01,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:01,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:01,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:01,876 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:01,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_13.cil.c [2019-11-23 22:48:01,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938c966cd/313405540d99428398ad4470b114245a/FLAG877cfda28 [2019-11-23 22:48:02,494 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:02,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_13.cil.c [2019-11-23 22:48:02,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938c966cd/313405540d99428398ad4470b114245a/FLAG877cfda28 [2019-11-23 22:48:02,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938c966cd/313405540d99428398ad4470b114245a [2019-11-23 22:48:02,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:02,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:02,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:02,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:02,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:02,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:02" (1/1) ... [2019-11-23 22:48:02,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f8855d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:02, skipping insertion in model container [2019-11-23 22:48:02,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:02" (1/1) ... [2019-11-23 22:48:02,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:02,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:03,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:03,139 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:03,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:03,322 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:03,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03 WrapperNode [2019-11-23 22:48:03,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:03,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:03,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:03,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:03,333 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:48:03" (1/1) ... [2019-11-23 22:48:03,344 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:48:03" (1/1) ... [2019-11-23 22:48:03,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:03,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:03,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:03,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:03,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:03,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:03,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:03,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:03,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (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:48:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:03,635 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:04,377 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:04,377 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:04,378 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:04,379 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:04,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:04 BoogieIcfgContainer [2019-11-23 22:48:04,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:04,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:04,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:04,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:04,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:02" (1/3) ... [2019-11-23 22:48:04,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dc5480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:04, skipping insertion in model container [2019-11-23 22:48:04,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03" (2/3) ... [2019-11-23 22:48:04,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dc5480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:04, skipping insertion in model container [2019-11-23 22:48:04,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:04" (3/3) ... [2019-11-23 22:48:04,388 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-11-23 22:48:04,397 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:04,405 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:04,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:04,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:04,444 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:04,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:04,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:04,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:04,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:04,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:04,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-23 22:48:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:48:04,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:04,471 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, 1, 1] [2019-11-23 22:48:04,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-11-23 22:48:04,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:04,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053719861] [2019-11-23 22:48:04,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:04,705 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:48:04,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053719861] [2019-11-23 22:48:04,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:04,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:04,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328787310] [2019-11-23 22:48:04,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:04,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:04,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:04,733 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-23 22:48:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,032 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-11-23 22:48:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:48:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,047 INFO L225 Difference]: With dead ends: 324 [2019-11-23 22:48:05,048 INFO L226 Difference]: Without dead ends: 159 [2019-11-23 22:48:05,052 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:48:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-23 22:48:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-23 22:48:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-23 22:48:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-11-23 22:48:05,104 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-11-23 22:48:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,105 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-11-23 22:48:05,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-11-23 22:48:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:05,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,107 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, 1, 1, 1] [2019-11-23 22:48:05,108 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-11-23 22:48:05,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031038511] [2019-11-23 22:48:05,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,176 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:48:05,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031038511] [2019-11-23 22:48:05,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181598040] [2019-11-23 22:48:05,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,181 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-11-23 22:48:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,361 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-11-23 22:48:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,364 INFO L225 Difference]: With dead ends: 329 [2019-11-23 22:48:05,365 INFO L226 Difference]: Without dead ends: 179 [2019-11-23 22:48:05,366 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:48:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-23 22:48:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-11-23 22:48:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-23 22:48:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-11-23 22:48:05,383 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-11-23 22:48:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,383 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-11-23 22:48:05,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-11-23 22:48:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:05,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,385 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, 1, 1, 1] [2019-11-23 22:48:05,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-11-23 22:48:05,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331773498] [2019-11-23 22:48:05,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,444 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:48:05,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331773498] [2019-11-23 22:48:05,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290171475] [2019-11-23 22:48:05,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,449 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-11-23 22:48:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,616 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-11-23 22:48:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,619 INFO L225 Difference]: With dead ends: 359 [2019-11-23 22:48:05,620 INFO L226 Difference]: Without dead ends: 187 [2019-11-23 22:48:05,621 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:48:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-23 22:48:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-23 22:48:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-23 22:48:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-23 22:48:05,636 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-11-23 22:48:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,638 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-23 22:48:05,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-11-23 22:48:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:05,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,639 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, 1, 1, 1] [2019-11-23 22:48:05,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-11-23 22:48:05,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045726613] [2019-11-23 22:48:05,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,739 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:48:05,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045726613] [2019-11-23 22:48:05,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549551767] [2019-11-23 22:48:05,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,742 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-11-23 22:48:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,907 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-11-23 22:48:05,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,911 INFO L225 Difference]: With dead ends: 364 [2019-11-23 22:48:05,911 INFO L226 Difference]: Without dead ends: 186 [2019-11-23 22:48:05,912 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:48:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-23 22:48:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-23 22:48:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-11-23 22:48:05,942 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-11-23 22:48:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,942 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-11-23 22:48:05,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-11-23 22:48:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:48:05,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,945 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, 1, 1, 1, 1] [2019-11-23 22:48:05,945 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-11-23 22:48:05,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571969299] [2019-11-23 22:48:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,001 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:48:06,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571969299] [2019-11-23 22:48:06,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882489342] [2019-11-23 22:48:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,004 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-11-23 22:48:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,178 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-11-23 22:48:06,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:48:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,180 INFO L225 Difference]: With dead ends: 375 [2019-11-23 22:48:06,180 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:48:06,181 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:48:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:48:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-23 22:48:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-11-23 22:48:06,190 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-11-23 22:48:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,190 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-11-23 22:48:06,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-11-23 22:48:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:48:06,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,192 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, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,192 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-11-23 22:48:06,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549849511] [2019-11-23 22:48:06,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,252 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:48:06,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549849511] [2019-11-23 22:48:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940712852] [2019-11-23 22:48:06,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,255 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-11-23 22:48:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,382 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-11-23 22:48:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:48:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,384 INFO L225 Difference]: With dead ends: 375 [2019-11-23 22:48:06,385 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:48:06,385 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:48:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:48:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-23 22:48:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-11-23 22:48:06,394 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-11-23 22:48:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,394 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-11-23 22:48:06,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-11-23 22:48:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:48:06,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,396 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,396 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-11-23 22:48:06,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132510021] [2019-11-23 22:48:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,422 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:48:06,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132510021] [2019-11-23 22:48:06,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041934803] [2019-11-23 22:48:06,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,425 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-11-23 22:48:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,581 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-11-23 22:48:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:48:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,583 INFO L225 Difference]: With dead ends: 375 [2019-11-23 22:48:06,583 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:48:06,584 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:48:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:48:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-23 22:48:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-11-23 22:48:06,592 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-11-23 22:48:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,593 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-11-23 22:48:06,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-11-23 22:48:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:48:06,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,594 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,594 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-11-23 22:48:06,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568051735] [2019-11-23 22:48:06,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,637 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:48:06,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568051735] [2019-11-23 22:48:06,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:06,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034923703] [2019-11-23 22:48:06,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:06,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:06,640 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-11-23 22:48:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,897 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-11-23 22:48:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:06,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-23 22:48:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,900 INFO L225 Difference]: With dead ends: 571 [2019-11-23 22:48:06,900 INFO L226 Difference]: Without dead ends: 392 [2019-11-23 22:48:06,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:48:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-23 22:48:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-11-23 22:48:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-23 22:48:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-11-23 22:48:06,923 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-11-23 22:48:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,923 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-11-23 22:48:06,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-11-23 22:48:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:48:06,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,926 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-11-23 22:48:06,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798759513] [2019-11-23 22:48:06,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,975 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:48:06,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798759513] [2019-11-23 22:48:06,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664717735] [2019-11-23 22:48:06,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,977 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-11-23 22:48:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,134 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-11-23 22:48:07,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:48:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,137 INFO L225 Difference]: With dead ends: 780 [2019-11-23 22:48:07,138 INFO L226 Difference]: Without dead ends: 431 [2019-11-23 22:48:07,139 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:48:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-23 22:48:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-11-23 22:48:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-23 22:48:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-11-23 22:48:07,157 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-11-23 22:48:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,157 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-11-23 22:48:07,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-11-23 22:48:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:48:07,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:07,159 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-11-23 22:48:07,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885862075] [2019-11-23 22:48:07,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,184 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:48:07,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885862075] [2019-11-23 22:48:07,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86103907] [2019-11-23 22:48:07,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,186 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-11-23 22:48:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,337 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-11-23 22:48:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:48:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,342 INFO L225 Difference]: With dead ends: 857 [2019-11-23 22:48:07,343 INFO L226 Difference]: Without dead ends: 453 [2019-11-23 22:48:07,344 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:48:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-23 22:48:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-11-23 22:48:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-23 22:48:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-11-23 22:48:07,369 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-11-23 22:48:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,372 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-11-23 22:48:07,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-11-23 22:48:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:48:07,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:07,373 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-11-23 22:48:07,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110611867] [2019-11-23 22:48:07,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,415 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:48:07,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110611867] [2019-11-23 22:48:07,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191137348] [2019-11-23 22:48:07,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,417 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-11-23 22:48:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,598 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-11-23 22:48:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:48:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,602 INFO L225 Difference]: With dead ends: 924 [2019-11-23 22:48:07,602 INFO L226 Difference]: Without dead ends: 498 [2019-11-23 22:48:07,603 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:48:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-23 22:48:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-11-23 22:48:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-23 22:48:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-11-23 22:48:07,623 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-11-23 22:48:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,624 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-11-23 22:48:07,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-11-23 22:48:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:07,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:07,625 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-11-23 22:48:07,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679554735] [2019-11-23 22:48:07,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,653 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:48:07,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679554735] [2019-11-23 22:48:07,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371221503] [2019-11-23 22:48:07,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,656 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-11-23 22:48:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,870 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-11-23 22:48:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,875 INFO L225 Difference]: With dead ends: 991 [2019-11-23 22:48:07,875 INFO L226 Difference]: Without dead ends: 510 [2019-11-23 22:48:07,877 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:48:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-23 22:48:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-11-23 22:48:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 22:48:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-11-23 22:48:07,904 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-11-23 22:48:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,904 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-11-23 22:48:07,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-11-23 22:48:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:48:07,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,906 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:07,906 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-11-23 22:48:07,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102285316] [2019-11-23 22:48:07,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:07,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102285316] [2019-11-23 22:48:07,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355248904] [2019-11-23 22:48:07,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,958 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-11-23 22:48:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,155 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-11-23 22:48:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-23 22:48:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,161 INFO L225 Difference]: With dead ends: 1007 [2019-11-23 22:48:08,162 INFO L226 Difference]: Without dead ends: 514 [2019-11-23 22:48:08,163 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:48:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-23 22:48:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-11-23 22:48:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 22:48:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-11-23 22:48:08,188 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-11-23 22:48:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,189 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-11-23 22:48:08,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-11-23 22:48:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:48:08,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,191 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:08,191 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-11-23 22:48:08,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951179512] [2019-11-23 22:48:08,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:08,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951179512] [2019-11-23 22:48:08,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533643781] [2019-11-23 22:48:08,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,245 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-11-23 22:48:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,428 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-11-23 22:48:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:48:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,431 INFO L225 Difference]: With dead ends: 1035 [2019-11-23 22:48:08,432 INFO L226 Difference]: Without dead ends: 542 [2019-11-23 22:48:08,433 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:48:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-23 22:48:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-11-23 22:48:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-23 22:48:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-11-23 22:48:08,455 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-11-23 22:48:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,456 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-11-23 22:48:08,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-11-23 22:48:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:48:08,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,458 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:08,458 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-11-23 22:48:08,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012664041] [2019-11-23 22:48:08,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:08,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012664041] [2019-11-23 22:48:08,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761686587] [2019-11-23 22:48:08,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,508 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-11-23 22:48:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,663 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-11-23 22:48:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:48:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,668 INFO L225 Difference]: With dead ends: 1095 [2019-11-23 22:48:08,668 INFO L226 Difference]: Without dead ends: 570 [2019-11-23 22:48:08,671 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:48:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-23 22:48:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-11-23 22:48:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-23 22:48:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-11-23 22:48:08,696 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-11-23 22:48:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,696 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-11-23 22:48:08,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-11-23 22:48:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:48:08,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,698 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:08,699 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-11-23 22:48:08,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62463326] [2019-11-23 22:48:08,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:08,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62463326] [2019-11-23 22:48:08,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975441354] [2019-11-23 22:48:08,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,743 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-11-23 22:48:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,881 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-11-23 22:48:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:48:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,885 INFO L225 Difference]: With dead ends: 1143 [2019-11-23 22:48:08,886 INFO L226 Difference]: Without dead ends: 580 [2019-11-23 22:48:08,887 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:48:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-23 22:48:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-11-23 22:48:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-23 22:48:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-11-23 22:48:08,911 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-11-23 22:48:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,911 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-11-23 22:48:08,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-11-23 22:48:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:08,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,915 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:08,915 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-11-23 22:48:08,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986064911] [2019-11-23 22:48:08,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:08,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986064911] [2019-11-23 22:48:08,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704414296] [2019-11-23 22:48:08,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,948 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-11-23 22:48:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,161 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-11-23 22:48:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,165 INFO L225 Difference]: With dead ends: 1180 [2019-11-23 22:48:09,166 INFO L226 Difference]: Without dead ends: 617 [2019-11-23 22:48:09,167 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:48:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-23 22:48:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-23 22:48:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-23 22:48:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-11-23 22:48:09,196 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-11-23 22:48:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,197 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-11-23 22:48:09,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-11-23 22:48:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:48:09,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,198 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:09,198 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,199 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-11-23 22:48:09,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141080913] [2019-11-23 22:48:09,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:09,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141080913] [2019-11-23 22:48:09,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:09,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200649466] [2019-11-23 22:48:09,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,233 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-11-23 22:48:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,387 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-11-23 22:48:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:48:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,390 INFO L225 Difference]: With dead ends: 1223 [2019-11-23 22:48:09,390 INFO L226 Difference]: Without dead ends: 617 [2019-11-23 22:48:09,392 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:48:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-23 22:48:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-23 22:48:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-23 22:48:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-11-23 22:48:09,414 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-11-23 22:48:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,414 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-11-23 22:48:09,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-11-23 22:48:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:09,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,416 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:09,416 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-11-23 22:48:09,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420020756] [2019-11-23 22:48:09,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 22:48:09,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420020756] [2019-11-23 22:48:09,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:09,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934808260] [2019-11-23 22:48:09,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,446 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-11-23 22:48:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,604 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-11-23 22:48:09,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,610 INFO L225 Difference]: With dead ends: 1255 [2019-11-23 22:48:09,610 INFO L226 Difference]: Without dead ends: 649 [2019-11-23 22:48:09,611 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:48:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-23 22:48:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-23 22:48:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:48:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-11-23 22:48:09,639 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-11-23 22:48:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,640 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-11-23 22:48:09,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-11-23 22:48:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:09,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,642 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:09,643 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-11-23 22:48:09,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743356862] [2019-11-23 22:48:09,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 22:48:09,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743356862] [2019-11-23 22:48:09,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:09,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118646301] [2019-11-23 22:48:09,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,682 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-11-23 22:48:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,834 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-11-23 22:48:09,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,838 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 22:48:09,838 INFO L226 Difference]: Without dead ends: 649 [2019-11-23 22:48:09,839 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:48:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-23 22:48:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-23 22:48:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:48:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-11-23 22:48:09,866 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-11-23 22:48:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,866 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-11-23 22:48:09,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-11-23 22:48:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-23 22:48:09,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,869 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:48:09,869 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-11-23 22:48:09,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709725651] [2019-11-23 22:48:09,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 22:48:09,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709725651] [2019-11-23 22:48:09,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:09,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371161290] [2019-11-23 22:48:09,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,942 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-11-23 22:48:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:10,096 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-11-23 22:48:10,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:10,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-23 22:48:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:10,100 INFO L225 Difference]: With dead ends: 1315 [2019-11-23 22:48:10,101 INFO L226 Difference]: Without dead ends: 681 [2019-11-23 22:48:10,102 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:48:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-23 22:48:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-23 22:48:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-23 22:48:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-11-23 22:48:10,129 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-11-23 22:48:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,130 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-11-23 22:48:10,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-11-23 22:48:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 22:48:10,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,134 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:10,134 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-11-23 22:48:10,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209741217] [2019-11-23 22:48:10,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 22:48:10,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209741217] [2019-11-23 22:48:10,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:10,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:10,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949928906] [2019-11-23 22:48:10,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:10,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:10,168 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-11-23 22:48:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:10,320 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-11-23 22:48:10,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:10,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 22:48:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:10,325 INFO L225 Difference]: With dead ends: 1351 [2019-11-23 22:48:10,325 INFO L226 Difference]: Without dead ends: 681 [2019-11-23 22:48:10,326 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:48:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-23 22:48:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-23 22:48:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-23 22:48:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-11-23 22:48:10,352 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-11-23 22:48:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,352 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-11-23 22:48:10,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-11-23 22:48:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:48:10,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,354 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-23 22:48:10,354 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-11-23 22:48:10,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974175871] [2019-11-23 22:48:10,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 22:48:10,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974175871] [2019-11-23 22:48:10,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:10,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:10,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946237500] [2019-11-23 22:48:10,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:10,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:10,398 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-11-23 22:48:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:10,450 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-11-23 22:48:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:10,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:48:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:10,459 INFO L225 Difference]: With dead ends: 2003 [2019-11-23 22:48:10,459 INFO L226 Difference]: Without dead ends: 1333 [2019-11-23 22:48:10,461 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:48:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-23 22:48:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-11-23 22:48:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-23 22:48:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-11-23 22:48:10,500 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-11-23 22:48:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,501 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-11-23 22:48:10,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-11-23 22:48:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:48:10,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,503 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-23 22:48:10,503 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-11-23 22:48:10,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878314360] [2019-11-23 22:48:10,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 22:48:10,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878314360] [2019-11-23 22:48:10,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:10,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:10,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068695155] [2019-11-23 22:48:10,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:10,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:10,597 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-11-23 22:48:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:10,634 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-11-23 22:48:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:10,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:48:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:10,638 INFO L225 Difference]: With dead ends: 1362 [2019-11-23 22:48:10,638 INFO L226 Difference]: Without dead ends: 690 [2019-11-23 22:48:10,640 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:48:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-23 22:48:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-11-23 22:48:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-23 22:48:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-11-23 22:48:10,669 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-11-23 22:48:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,670 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-11-23 22:48:10,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-11-23 22:48:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:48:10,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,674 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-23 22:48:10,674 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-11-23 22:48:10,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451376147] [2019-11-23 22:48:10,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:48:10,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451376147] [2019-11-23 22:48:10,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:10,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:10,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384942743] [2019-11-23 22:48:10,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:10,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:10,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:10,746 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-11-23 22:48:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:10,821 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-11-23 22:48:10,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:10,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:48:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:10,828 INFO L225 Difference]: With dead ends: 2017 [2019-11-23 22:48:10,828 INFO L226 Difference]: Without dead ends: 1347 [2019-11-23 22:48:10,829 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:48:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-23 22:48:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-11-23 22:48:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-11-23 22:48:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-11-23 22:48:10,879 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-11-23 22:48:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,879 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-11-23 22:48:10,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-11-23 22:48:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:48:10,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,882 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-23 22:48:10,883 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-11-23 22:48:10,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735005039] [2019-11-23 22:48:10,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:11,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:48:11,020 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:48:11,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:11 BoogieIcfgContainer [2019-11-23 22:48:11,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:11,124 INFO L168 Benchmark]: Toolchain (without parser) took 8302.35 ms. Allocated memory was 146.3 MB in the beginning and 359.1 MB in the end (delta: 212.9 MB). Free memory was 102.9 MB in the beginning and 200.9 MB in the end (delta: -98.0 MB). Peak memory consumption was 114.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:11,125 INFO L168 Benchmark]: CDTParser took 0.51 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 22:48:11,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.04 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 178.7 MB in the end (delta: -76.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:11,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.58 ms. Allocated memory is still 203.9 MB. Free memory was 178.7 MB in the beginning and 175.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:11,132 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 203.9 MB. Free memory was 175.3 MB in the beginning and 173.3 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:48:11,133 INFO L168 Benchmark]: RCFGBuilder took 946.72 ms. Allocated memory is still 203.9 MB. Free memory was 173.3 MB in the beginning and 117.9 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:11,134 INFO L168 Benchmark]: TraceAbstraction took 6739.89 ms. Allocated memory was 203.9 MB in the beginning and 359.1 MB in the end (delta: 155.2 MB). Free memory was 117.9 MB in the beginning and 200.9 MB in the end (delta: -83.0 MB). Peak memory consumption was 72.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:11,136 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.51 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 502.04 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 178.7 MB in the end (delta: -76.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.58 ms. Allocated memory is still 203.9 MB. Free memory was 178.7 MB in the beginning and 175.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 203.9 MB. Free memory was 175.3 MB in the beginning and 173.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 946.72 ms. Allocated memory is still 203.9 MB. Free memory was 173.3 MB in the beginning and 117.9 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6739.89 ms. Allocated memory was 203.9 MB in the beginning and 359.1 MB in the end (delta: 155.2 MB). Free memory was 117.9 MB in the beginning and 200.9 MB in the end (delta: -83.0 MB). Peak memory consumption was 72.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 = __VERIFIER_nondet_int() ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.6s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 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 incorrect! Received shutdown request...