/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_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:02,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:02,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:02,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:02,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:02,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:02,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:02,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:02,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:02,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:02,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:02,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:02,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:02,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:02,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:02,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:02,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:02,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:02,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:02,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:02,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:02,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:02,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:02,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:02,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:02,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:02,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:02,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:02,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:02,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:02,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:02,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:02,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:02,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:02,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:02,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:02,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:02,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:02,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:02,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:02,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:02,713 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:02,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:02,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:02,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:02,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:02,735 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:02,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:02,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:02,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:02,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:02,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:02,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:02,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:02,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:02,737 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:02,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:02,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:02,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:02,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:02,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:02,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:02,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:02,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:02,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:02,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:02,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:02,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:02,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:02,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:02,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:02,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:03,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:03,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:03,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:03,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:03,044 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:03,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-23 22:48:03,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e71eea7/88bc1c45c91d4a1794a2944e0a10cd3d/FLAGc88304a5b [2019-11-23 22:48:03,595 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:03,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-23 22:48:03,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e71eea7/88bc1c45c91d4a1794a2944e0a10cd3d/FLAGc88304a5b [2019-11-23 22:48:03,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e71eea7/88bc1c45c91d4a1794a2944e0a10cd3d [2019-11-23 22:48:03,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:03,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:03,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:03,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:03,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:03,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3399fa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:03, skipping insertion in model container [2019-11-23 22:48:03,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:03" (1/1) ... [2019-11-23 22:48:03,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:04,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:04,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:04,324 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:04,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:04,498 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:04,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:04 WrapperNode [2019-11-23 22:48:04,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:04,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:04,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:04,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:04,508 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:04" (1/1) ... [2019-11-23 22:48:04,518 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:04" (1/1) ... [2019-11-23 22:48:04,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:04,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:04,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:04,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:04,603 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:04" (1/1) ... [2019-11-23 22:48:04,603 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:04" (1/1) ... [2019-11-23 22:48:04,614 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:04" (1/1) ... [2019-11-23 22:48:04,614 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:04" (1/1) ... [2019-11-23 22:48:04,629 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:04" (1/1) ... [2019-11-23 22:48:04,648 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:04" (1/1) ... [2019-11-23 22:48:04,651 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:04" (1/1) ... [2019-11-23 22:48:04,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:04,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:04,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:04,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:04,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:04" (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:04,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:04,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:04,953 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:05,650 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:05,651 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:05,653 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:05,653 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:05,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:05 BoogieIcfgContainer [2019-11-23 22:48:05,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:05,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:05,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:05,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:05,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:03" (1/3) ... [2019-11-23 22:48:05,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd1a1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:05, skipping insertion in model container [2019-11-23 22:48:05,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:04" (2/3) ... [2019-11-23 22:48:05,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd1a1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:05, skipping insertion in model container [2019-11-23 22:48:05,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:05" (3/3) ... [2019-11-23 22:48:05,667 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-23 22:48:05,678 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:05,688 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:05,701 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:05,748 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:05,748 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:05,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:05,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:05,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:05,751 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:05,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:05,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-23 22:48:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:48:05,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,778 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] [2019-11-23 22:48:05,779 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-11-23 22:48:05,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556807841] [2019-11-23 22:48:05,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,014 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,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556807841] [2019-11-23 22:48:06,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044740669] [2019-11-23 22:48:06,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,048 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-11-23 22:48:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,352 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-11-23 22:48:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:48:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,369 INFO L225 Difference]: With dead ends: 323 [2019-11-23 22:48:06,370 INFO L226 Difference]: Without dead ends: 160 [2019-11-23 22:48:06,374 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,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-23 22:48:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-11-23 22:48:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-23 22:48:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-11-23 22:48:06,480 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-11-23 22:48:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,481 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-11-23 22:48:06,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-11-23 22:48:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:48:06,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,486 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-11-23 22:48:06,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266520623] [2019-11-23 22:48:06,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,565 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,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266520623] [2019-11-23 22:48:06,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304408441] [2019-11-23 22:48:06,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,569 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-11-23 22:48:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,702 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-11-23 22:48:06,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:48:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,705 INFO L225 Difference]: With dead ends: 330 [2019-11-23 22:48:06,705 INFO L226 Difference]: Without dead ends: 181 [2019-11-23 22:48:06,707 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,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-23 22:48:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-23 22:48:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-23 22:48:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-11-23 22:48:06,722 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-11-23 22:48:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,722 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-11-23 22:48:06,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-11-23 22:48:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:48:06,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-11-23 22:48:06,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886404711] [2019-11-23 22:48:06,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,782 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,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886404711] [2019-11-23 22:48:06,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022611616] [2019-11-23 22:48:06,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,785 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-11-23 22:48:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,956 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-11-23 22:48:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:48:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,958 INFO L225 Difference]: With dead ends: 361 [2019-11-23 22:48:06,958 INFO L226 Difference]: Without dead ends: 189 [2019-11-23 22:48:06,960 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,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-23 22:48:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-11-23 22:48:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-23 22:48:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-11-23 22:48:06,981 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-11-23 22:48:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-11-23 22:48:06,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-11-23 22:48:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:48:06,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,984 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-11-23 22:48:06,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945305726] [2019-11-23 22:48:06,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,069 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,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945305726] [2019-11-23 22:48:07,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245623739] [2019-11-23 22:48:07,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,072 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-11-23 22:48:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,226 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-11-23 22:48:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:48:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,230 INFO L225 Difference]: With dead ends: 366 [2019-11-23 22:48:07,230 INFO L226 Difference]: Without dead ends: 188 [2019-11-23 22:48:07,232 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,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-23 22:48:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-11-23 22:48:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-11-23 22:48:07,260 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-11-23 22:48:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,260 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-11-23 22:48:07,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-11-23 22:48:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:48:07,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,263 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] [2019-11-23 22:48:07,263 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-11-23 22:48:07,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079143121] [2019-11-23 22:48:07,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,346 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,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079143121] [2019-11-23 22:48:07,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620537076] [2019-11-23 22:48:07,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,350 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-11-23 22:48:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,494 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-11-23 22:48:07,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:48:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,496 INFO L225 Difference]: With dead ends: 377 [2019-11-23 22:48:07,496 INFO L226 Difference]: Without dead ends: 198 [2019-11-23 22:48:07,497 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,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-23 22:48:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-23 22:48:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-11-23 22:48:07,506 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-11-23 22:48:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,506 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-11-23 22:48:07,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-11-23 22:48:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:48:07,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,508 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:07,508 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-11-23 22:48:07,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750155004] [2019-11-23 22:48:07,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,546 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,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750155004] [2019-11-23 22:48:07,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565155634] [2019-11-23 22:48:07,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,550 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-11-23 22:48:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,691 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-11-23 22:48:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:48:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,694 INFO L225 Difference]: With dead ends: 377 [2019-11-23 22:48:07,694 INFO L226 Difference]: Without dead ends: 198 [2019-11-23 22:48:07,695 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,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-23 22:48:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-23 22:48:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-11-23 22:48:07,708 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-11-23 22:48:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,708 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-11-23 22:48:07,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-11-23 22:48:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:07,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,711 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:07,711 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-11-23 22:48:07,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368835512] [2019-11-23 22:48:07,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,765 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,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368835512] [2019-11-23 22:48:07,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901014852] [2019-11-23 22:48:07,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,767 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-11-23 22:48:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,891 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-11-23 22:48:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,893 INFO L225 Difference]: With dead ends: 377 [2019-11-23 22:48:07,893 INFO L226 Difference]: Without dead ends: 198 [2019-11-23 22:48:07,894 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,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-23 22:48:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-23 22:48:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:48:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-11-23 22:48:07,905 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-11-23 22:48:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,906 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-11-23 22:48:07,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-11-23 22:48:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:07,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,911 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:07,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-11-23 22:48:07,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99544194] [2019-11-23 22:48:07,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,972 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,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99544194] [2019-11-23 22:48:07,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:07,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747096496] [2019-11-23 22:48:07,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,976 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-11-23 22:48:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,001 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-11-23 22:48:08,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,006 INFO L225 Difference]: With dead ends: 536 [2019-11-23 22:48:08,006 INFO L226 Difference]: Without dead ends: 357 [2019-11-23 22:48:08,007 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:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-23 22:48:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-11-23 22:48:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-23 22:48:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-11-23 22:48:08,025 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-11-23 22:48:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,025 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-11-23 22:48:08,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-11-23 22:48:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:48:08,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,026 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:08,026 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-11-23 22:48:08,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590691155] [2019-11-23 22:48:08,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,079 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:08,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590691155] [2019-11-23 22:48:08,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:08,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261442646] [2019-11-23 22:48:08,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:08,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:08,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:08,082 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-11-23 22:48:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,362 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-11-23 22:48:08,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:08,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-23 22:48:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,368 INFO L225 Difference]: With dead ends: 1099 [2019-11-23 22:48:08,369 INFO L226 Difference]: Without dead ends: 752 [2019-11-23 22:48:08,370 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:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-23 22:48:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-11-23 22:48:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-23 22:48:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-11-23 22:48:08,397 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-11-23 22:48:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,397 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-11-23 22:48:08,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-11-23 22:48:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:48:08,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,399 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, 1] [2019-11-23 22:48:08,399 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-11-23 22:48:08,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796476727] [2019-11-23 22:48:08,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,430 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:08,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796476727] [2019-11-23 22:48:08,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243237117] [2019-11-23 22:48:08,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,432 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-11-23 22:48:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,606 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-11-23 22:48:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-23 22:48:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,614 INFO L225 Difference]: With dead ends: 1330 [2019-11-23 22:48:08,615 INFO L226 Difference]: Without dead ends: 740 [2019-11-23 22:48:08,616 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,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-23 22:48:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-11-23 22:48:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-23 22:48:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-11-23 22:48:08,649 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-11-23 22:48:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,651 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-11-23 22:48:08,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-11-23 22:48:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:48:08,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,654 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, 1, 1] [2019-11-23 22:48:08,654 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-11-23 22:48:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669412066] [2019-11-23 22:48:08,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,708 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:08,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669412066] [2019-11-23 22:48:08,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080415272] [2019-11-23 22:48:08,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,712 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-11-23 22:48:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,912 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-11-23 22:48:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-23 22:48:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,917 INFO L225 Difference]: With dead ends: 1497 [2019-11-23 22:48:08,917 INFO L226 Difference]: Without dead ends: 785 [2019-11-23 22:48:08,919 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,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-23 22:48:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-11-23 22:48:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-23 22:48:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-11-23 22:48:08,951 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-11-23 22:48:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,951 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-11-23 22:48:08,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-11-23 22:48:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 22:48:08,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,953 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:08,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-11-23 22:48:08,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686525925] [2019-11-23 22:48:08,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:08,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686525925] [2019-11-23 22:48:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526792197] [2019-11-23 22:48:08,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,987 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-11-23 22:48:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,014 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-11-23 22:48:09,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-23 22:48:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,019 INFO L225 Difference]: With dead ends: 1522 [2019-11-23 22:48:09,019 INFO L226 Difference]: Without dead ends: 765 [2019-11-23 22:48:09,021 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,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-23 22:48:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-11-23 22:48:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-23 22:48:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-11-23 22:48:09,055 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-11-23 22:48:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,055 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-11-23 22:48:09,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-11-23 22:48:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:48:09,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,057 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:09,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-11-23 22:48:09,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193541197] [2019-11-23 22:48:09,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:09,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193541197] [2019-11-23 22:48:09,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:09,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629514762] [2019-11-23 22:48:09,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,108 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-11-23 22:48:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,146 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-11-23 22:48:09,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:48:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,151 INFO L225 Difference]: With dead ends: 1536 [2019-11-23 22:48:09,151 INFO L226 Difference]: Without dead ends: 779 [2019-11-23 22:48:09,153 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,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-23 22:48:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-11-23 22:48:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-23 22:48:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-11-23 22:48:09,184 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-11-23 22:48:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,184 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-11-23 22:48:09,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-11-23 22:48:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:48:09,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,186 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] [2019-11-23 22:48:09,186 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-11-23 22:48:09,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697280130] [2019-11-23 22:48:09,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,212 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:09,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697280130] [2019-11-23 22:48:09,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:09,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582268120] [2019-11-23 22:48:09,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,215 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-11-23 22:48:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,265 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-11-23 22:48:09,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:48:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,275 INFO L225 Difference]: With dead ends: 2298 [2019-11-23 22:48:09,276 INFO L226 Difference]: Without dead ends: 1529 [2019-11-23 22:48:09,278 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:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-11-23 22:48:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-11-23 22:48:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-23 22:48:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-11-23 22:48:09,349 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-11-23 22:48:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,350 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-11-23 22:48:09,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-11-23 22:48:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:48:09,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,352 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] [2019-11-23 22:48:09,352 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-11-23 22:48:09,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398771897] [2019-11-23 22:48:09,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,402 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:09,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398771897] [2019-11-23 22:48:09,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:09,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760479636] [2019-11-23 22:48:09,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,405 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-11-23 22:48:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,741 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-11-23 22:48:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:48:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,750 INFO L225 Difference]: With dead ends: 2638 [2019-11-23 22:48:09,750 INFO L226 Difference]: Without dead ends: 1430 [2019-11-23 22:48:09,755 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:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-11-23 22:48:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-11-23 22:48:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-23 22:48:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-11-23 22:48:09,835 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-11-23 22:48:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,835 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-11-23 22:48:09,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-11-23 22:48:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:48:09,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,839 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:09,839 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-11-23 22:48:09,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258362910] [2019-11-23 22:48:09,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:48:09,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258362910] [2019-11-23 22:48:09,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:09,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:09,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814688308] [2019-11-23 22:48:09,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:09,884 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-11-23 22:48:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,943 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-11-23 22:48:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:48:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,951 INFO L225 Difference]: With dead ends: 2486 [2019-11-23 22:48:09,952 INFO L226 Difference]: Without dead ends: 1659 [2019-11-23 22:48:09,953 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:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-11-23 22:48:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-11-23 22:48:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-23 22:48:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-11-23 22:48:10,008 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-11-23 22:48:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,008 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-11-23 22:48:10,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-11-23 22:48:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:48:10,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,012 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:10,012 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-11-23 22:48:10,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951852633] [2019-11-23 22:48:10,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:10,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951852633] [2019-11-23 22:48:10,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:10,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:10,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306953784] [2019-11-23 22:48:10,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:10,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:10,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:10,056 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-11-23 22:48:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:10,141 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-11-23 22:48:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:10,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:48:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:10,152 INFO L225 Difference]: With dead ends: 3421 [2019-11-23 22:48:10,153 INFO L226 Difference]: Without dead ends: 2245 [2019-11-23 22:48:10,155 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,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-23 22:48:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-11-23 22:48:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-11-23 22:48:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-11-23 22:48:10,270 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-11-23 22:48:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,270 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-11-23 22:48:10,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-11-23 22:48:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:48:10,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,275 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:10,275 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-11-23 22:48:10,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319411650] [2019-11-23 22:48:10,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:10,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:48:10,333 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:48:10,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:10 BoogieIcfgContainer [2019-11-23 22:48:10,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:10,395 INFO L168 Benchmark]: Toolchain (without parser) took 6414.14 ms. Allocated memory was 146.3 MB in the beginning and 318.8 MB in the end (delta: 172.5 MB). Free memory was 104.0 MB in the beginning and 249.8 MB in the end (delta: -145.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:10,398 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 22:48:10,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.99 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.6 MB in the beginning and 179.2 MB in the end (delta: -75.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:10,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.69 ms. Allocated memory is still 203.9 MB. Free memory was 179.2 MB in the beginning and 175.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:10,400 INFO L168 Benchmark]: Boogie Preprocessor took 80.19 ms. Allocated memory is still 203.9 MB. Free memory was 175.9 MB in the beginning and 173.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:10,402 INFO L168 Benchmark]: RCFGBuilder took 993.13 ms. Allocated memory is still 203.9 MB. Free memory was 173.0 MB in the beginning and 116.8 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:10,403 INFO L168 Benchmark]: TraceAbstraction took 4731.22 ms. Allocated memory was 203.9 MB in the beginning and 318.8 MB in the end (delta: 114.8 MB). Free memory was 116.8 MB in the beginning and 249.8 MB in the end (delta: -133.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 22:48:10,414 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.21 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 519.99 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.6 MB in the beginning and 179.2 MB in the end (delta: -75.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.69 ms. Allocated memory is still 203.9 MB. Free memory was 179.2 MB in the beginning and 175.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.19 ms. Allocated memory is still 203.9 MB. Free memory was 175.9 MB in the beginning and 173.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 993.13 ms. Allocated memory is still 203.9 MB. Free memory was 173.0 MB in the beginning and 116.8 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4731.22 ms. Allocated memory was 203.9 MB in the beginning and 318.8 MB in the end (delta: 114.8 MB). Free memory was 116.8 MB in the beginning and 249.8 MB in the end (delta: -133.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] 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 = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [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 ; [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__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND TRUE cb != 0 [L621] COND TRUE s__state != state [L622] new_state = s__state [L623] s__state = state [L624] s__state = new_state [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.6s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, 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, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 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...