/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_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:12,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:12,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:12,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:12,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:12,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:12,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:12,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:12,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:12,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:12,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:12,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:12,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:12,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:12,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:12,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:12,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:12,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:12,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:12,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:12,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:12,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:12,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:12,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:12,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:12,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:12,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:12,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:12,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:12,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:12,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:12,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:12,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:12,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:12,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:12,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:12,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:12,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:12,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:12,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:12,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:12,564 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:12,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:12,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:12,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:12,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:12,582 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:12,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:12,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:12,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:12,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:12,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:12,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:12,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:12,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:12,584 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:12,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:12,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:12,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:12,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:12,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:12,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:12,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:12,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:12,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:12,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:12,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:12,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:12,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:12,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:12,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:12,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:12,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:12,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:12,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:12,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:12,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:12,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-11-23 22:48:12,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6636caaf5/58e132055ace4b1baaa0343b1534f952/FLAG3e9f3eb10 [2019-11-23 22:48:13,491 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:13,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-11-23 22:48:13,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6636caaf5/58e132055ace4b1baaa0343b1534f952/FLAG3e9f3eb10 [2019-11-23 22:48:13,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6636caaf5/58e132055ace4b1baaa0343b1534f952 [2019-11-23 22:48:13,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:13,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:13,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:13,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:13,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:13,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:13" (1/1) ... [2019-11-23 22:48:13,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bdfaca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:13, skipping insertion in model container [2019-11-23 22:48:13,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:13" (1/1) ... [2019-11-23 22:48:13,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:13,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:14,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:14,152 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:14,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:14,344 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:14,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:14 WrapperNode [2019-11-23 22:48:14,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:14,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:14,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:14,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:14,352 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:14" (1/1) ... [2019-11-23 22:48:14,361 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:14" (1/1) ... [2019-11-23 22:48:14,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:14,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:14,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:14,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:14,418 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:14" (1/1) ... [2019-11-23 22:48:14,419 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:14" (1/1) ... [2019-11-23 22:48:14,422 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:14" (1/1) ... [2019-11-23 22:48:14,422 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:14" (1/1) ... [2019-11-23 22:48:14,430 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:14" (1/1) ... [2019-11-23 22:48:14,438 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:14" (1/1) ... [2019-11-23 22:48:14,441 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:14" (1/1) ... [2019-11-23 22:48:14,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:14,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:14,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:14,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:14,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:14" (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:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:14,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:14,643 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:15,335 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:15,336 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:15,337 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:15,337 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:15,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:15 BoogieIcfgContainer [2019-11-23 22:48:15,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:15,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:15,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:15,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:15,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:13" (1/3) ... [2019-11-23 22:48:15,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c889db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:15, skipping insertion in model container [2019-11-23 22:48:15,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:14" (2/3) ... [2019-11-23 22:48:15,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c889db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:15, skipping insertion in model container [2019-11-23 22:48:15,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:15" (3/3) ... [2019-11-23 22:48:15,347 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-11-23 22:48:15,357 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:15,364 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:15,376 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:15,403 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:15,403 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:15,403 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:15,403 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:15,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:15,404 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:15,404 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:15,404 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-23 22:48:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 22:48:15,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:15,433 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, 1] [2019-11-23 22:48:15,434 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-23 22:48:15,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:15,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547568270] [2019-11-23 22:48:15,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:15,692 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:15,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547568270] [2019-11-23 22:48:15,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:15,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:15,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607466437] [2019-11-23 22:48:15,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:15,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:15,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:15,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:15,718 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-23 22:48:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:16,146 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-23 22:48:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:16,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-23 22:48:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:16,163 INFO L225 Difference]: With dead ends: 327 [2019-11-23 22:48:16,164 INFO L226 Difference]: Without dead ends: 174 [2019-11-23 22:48:16,168 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:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-23 22:48:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-23 22:48:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-23 22:48:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-23 22:48:16,243 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-23 22:48:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:16,243 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-23 22:48:16,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-23 22:48:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:48:16,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:16,250 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, 1, 1] [2019-11-23 22:48:16,251 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-23 22:48:16,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:16,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241483905] [2019-11-23 22:48:16,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:16,405 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:16,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241483905] [2019-11-23 22:48:16,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:16,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:16,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787723639] [2019-11-23 22:48:16,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:16,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:16,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:16,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:16,411 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-23 22:48:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:16,661 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-23 22:48:16,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:16,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:48:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:16,663 INFO L225 Difference]: With dead ends: 379 [2019-11-23 22:48:16,664 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 22:48:16,666 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:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 22:48:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-23 22:48:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-23 22:48:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-23 22:48:16,683 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-23 22:48:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-23 22:48:16,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-23 22:48:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 22:48:16,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:16,687 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:16,688 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-11-23 22:48:16,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:16,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059846713] [2019-11-23 22:48:16,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:16,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059846713] [2019-11-23 22:48:16,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:16,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:16,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752632406] [2019-11-23 22:48:16,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:16,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:16,764 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-23 22:48:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:16,968 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-23 22:48:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:16,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 22:48:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:16,971 INFO L225 Difference]: With dead ends: 444 [2019-11-23 22:48:16,972 INFO L226 Difference]: Without dead ends: 241 [2019-11-23 22:48:16,974 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:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-23 22:48:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-23 22:48:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-23 22:48:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-23 22:48:17,003 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-23 22:48:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,004 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-23 22:48:17,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-23 22:48:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:17,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,009 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,009 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-11-23 22:48:17,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100153863] [2019-11-23 22:48:17,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:17,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100153863] [2019-11-23 22:48:17,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97087416] [2019-11-23 22:48:17,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,120 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-23 22:48:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,257 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-23 22:48:17,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,260 INFO L225 Difference]: With dead ends: 492 [2019-11-23 22:48:17,260 INFO L226 Difference]: Without dead ends: 258 [2019-11-23 22:48:17,261 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:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-23 22:48:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-23 22:48:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-23 22:48:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-23 22:48:17,274 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-23 22:48:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,274 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-23 22:48:17,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-23 22:48:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:17,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,277 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-11-23 22:48:17,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483649886] [2019-11-23 22:48:17,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:17,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483649886] [2019-11-23 22:48:17,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256107060] [2019-11-23 22:48:17,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,342 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-23 22:48:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,510 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-23 22:48:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,514 INFO L225 Difference]: With dead ends: 551 [2019-11-23 22:48:17,514 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 22:48:17,515 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:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 22:48:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-23 22:48:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:48:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-23 22:48:17,527 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-23 22:48:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,527 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-23 22:48:17,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-23 22:48:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:17,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,529 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,530 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,530 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-11-23 22:48:17,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087244490] [2019-11-23 22:48:17,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:17,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087244490] [2019-11-23 22:48:17,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834669555] [2019-11-23 22:48:17,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,583 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-23 22:48:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,716 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-23 22:48:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,718 INFO L225 Difference]: With dead ends: 591 [2019-11-23 22:48:17,719 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:48:17,719 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:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:48:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-23 22:48:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:48:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-23 22:48:17,731 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-23 22:48:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,731 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-23 22:48:17,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-23 22:48:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:17,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,734 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,734 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-11-23 22:48:17,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77207558] [2019-11-23 22:48:17,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:17,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77207558] [2019-11-23 22:48:17,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934762050] [2019-11-23 22:48:17,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,826 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-23 22:48:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,994 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-23 22:48:17,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,998 INFO L225 Difference]: With dead ends: 593 [2019-11-23 22:48:17,998 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:48:17,999 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:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:48:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-23 22:48:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-23 22:48:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-23 22:48:18,012 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-23 22:48:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,013 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-23 22:48:18,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-23 22:48:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 22:48:18,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,015 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,016 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-11-23 22:48:18,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118448029] [2019-11-23 22:48:18,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 22:48:18,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118448029] [2019-11-23 22:48:18,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968464868] [2019-11-23 22:48:18,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,054 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-23 22:48:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,168 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-23 22:48:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 22:48:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,170 INFO L225 Difference]: With dead ends: 594 [2019-11-23 22:48:18,171 INFO L226 Difference]: Without dead ends: 305 [2019-11-23 22:48:18,172 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:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-23 22:48:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-23 22:48:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-23 22:48:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-23 22:48:18,185 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-23 22:48:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,185 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-23 22:48:18,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-23 22:48:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:48:18,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,188 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-11-23 22:48:18,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853938198] [2019-11-23 22:48:18,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:18,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853938198] [2019-11-23 22:48:18,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760889081] [2019-11-23 22:48:18,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,251 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-23 22:48:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,418 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-23 22:48:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:48:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,421 INFO L225 Difference]: With dead ends: 634 [2019-11-23 22:48:18,421 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 22:48:18,422 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:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 22:48:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-23 22:48:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:48:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-23 22:48:18,434 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-23 22:48:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,434 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-23 22:48:18,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-23 22:48:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:48:18,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,437 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,437 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-11-23 22:48:18,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806719083] [2019-11-23 22:48:18,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:18,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806719083] [2019-11-23 22:48:18,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86407365] [2019-11-23 22:48:18,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,483 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-23 22:48:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,665 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-23 22:48:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:48:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,668 INFO L225 Difference]: With dead ends: 663 [2019-11-23 22:48:18,668 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 22:48:18,669 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:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 22:48:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-23 22:48:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:48:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-23 22:48:18,683 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-23 22:48:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,683 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-23 22:48:18,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-23 22:48:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:48:18,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,685 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,685 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-11-23 22:48:18,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168171098] [2019-11-23 22:48:18,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:18,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168171098] [2019-11-23 22:48:18,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623897663] [2019-11-23 22:48:18,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,730 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-23 22:48:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,918 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-23 22:48:18,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:48:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,922 INFO L225 Difference]: With dead ends: 696 [2019-11-23 22:48:18,923 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:48:18,924 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:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:48:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-23 22:48:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:48:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-23 22:48:18,943 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-23 22:48:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,943 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-23 22:48:18,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-23 22:48:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:48:18,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,945 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-11-23 22:48:18,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157593741] [2019-11-23 22:48:18,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:18,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157593741] [2019-11-23 22:48:18,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542728038] [2019-11-23 22:48:18,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,999 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-23 22:48:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,161 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-23 22:48:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:48:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,164 INFO L225 Difference]: With dead ends: 723 [2019-11-23 22:48:19,164 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:48:19,165 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:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:48:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-23 22:48:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:48:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-23 22:48:19,180 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-23 22:48:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,181 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-23 22:48:19,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-23 22:48:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:48:19,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,183 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-11-23 22:48:19,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538098165] [2019-11-23 22:48:19,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:19,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538098165] [2019-11-23 22:48:19,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442959260] [2019-11-23 22:48:19,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,257 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-23 22:48:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,389 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-11-23 22:48:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:48:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,393 INFO L225 Difference]: With dead ends: 741 [2019-11-23 22:48:19,393 INFO L226 Difference]: Without dead ends: 387 [2019-11-23 22:48:19,395 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:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-23 22:48:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-23 22:48:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:48:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-23 22:48:19,409 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-23 22:48:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,410 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-23 22:48:19,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-23 22:48:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:48:19,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,412 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,412 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-11-23 22:48:19,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369236901] [2019-11-23 22:48:19,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:19,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369236901] [2019-11-23 22:48:19,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239393766] [2019-11-23 22:48:19,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,456 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-23 22:48:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,592 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-11-23 22:48:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:48:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,595 INFO L225 Difference]: With dead ends: 762 [2019-11-23 22:48:19,595 INFO L226 Difference]: Without dead ends: 387 [2019-11-23 22:48:19,597 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:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-23 22:48:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-23 22:48:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:48:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-23 22:48:19,613 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-23 22:48:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,613 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-23 22:48:19,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-23 22:48:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:48:19,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,615 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,616 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-11-23 22:48:19,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165533840] [2019-11-23 22:48:19,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 22:48:19,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165533840] [2019-11-23 22:48:19,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:19,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348752710] [2019-11-23 22:48:19,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,672 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-23 22:48:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,730 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-23 22:48:19,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 22:48:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,737 INFO L225 Difference]: With dead ends: 757 [2019-11-23 22:48:19,737 INFO L226 Difference]: Without dead ends: 755 [2019-11-23 22:48:19,740 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:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-23 22:48:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-23 22:48:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-23 22:48:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-23 22:48:19,766 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-23 22:48:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,767 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-23 22:48:19,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-23 22:48:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:48:19,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,770 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,770 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1007661097, now seen corresponding path program 1 times [2019-11-23 22:48:19,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94495975] [2019-11-23 22:48:19,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:19,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94495975] [2019-11-23 22:48:19,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:19,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166335732] [2019-11-23 22:48:19,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,823 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-23 22:48:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,890 INFO L93 Difference]: Finished difference Result 1871 states and 2963 transitions. [2019-11-23 22:48:19,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:48:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,897 INFO L225 Difference]: With dead ends: 1871 [2019-11-23 22:48:19,897 INFO L226 Difference]: Without dead ends: 1123 [2019-11-23 22:48:19,899 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:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-23 22:48:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-23 22:48:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 22:48:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1776 transitions. [2019-11-23 22:48:19,942 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1776 transitions. Word has length 121 [2019-11-23 22:48:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,942 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1776 transitions. [2019-11-23 22:48:19,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1776 transitions. [2019-11-23 22:48:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:48:19,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,946 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,946 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash 381632917, now seen corresponding path program 1 times [2019-11-23 22:48:19,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144275106] [2019-11-23 22:48:19,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 22:48:19,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144275106] [2019-11-23 22:48:19,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562480563] [2019-11-23 22:48:19,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,979 INFO L87 Difference]: Start difference. First operand 1123 states and 1776 transitions. Second operand 3 states. [2019-11-23 22:48:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,045 INFO L93 Difference]: Finished difference Result 2590 states and 4096 transitions. [2019-11-23 22:48:20,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:48:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,053 INFO L225 Difference]: With dead ends: 2590 [2019-11-23 22:48:20,053 INFO L226 Difference]: Without dead ends: 1474 [2019-11-23 22:48:20,056 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:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-11-23 22:48:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2019-11-23 22:48:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-11-23 22:48:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2327 transitions. [2019-11-23 22:48:20,117 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2327 transitions. Word has length 121 [2019-11-23 22:48:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,117 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2327 transitions. [2019-11-23 22:48:20,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2327 transitions. [2019-11-23 22:48:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:48:20,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,122 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:20,122 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2067443667, now seen corresponding path program 1 times [2019-11-23 22:48:20,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517785485] [2019-11-23 22:48:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-23 22:48:20,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517785485] [2019-11-23 22:48:20,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:20,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479837560] [2019-11-23 22:48:20,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,169 INFO L87 Difference]: Start difference. First operand 1474 states and 2327 transitions. Second operand 3 states. [2019-11-23 22:48:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,375 INFO L93 Difference]: Finished difference Result 2981 states and 4691 transitions. [2019-11-23 22:48:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:48:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,386 INFO L225 Difference]: With dead ends: 2981 [2019-11-23 22:48:20,386 INFO L226 Difference]: Without dead ends: 1514 [2019-11-23 22:48:20,389 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:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-11-23 22:48:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1474. [2019-11-23 22:48:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-11-23 22:48:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2183 transitions. [2019-11-23 22:48:20,471 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2183 transitions. Word has length 158 [2019-11-23 22:48:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,472 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2183 transitions. [2019-11-23 22:48:20,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2183 transitions. [2019-11-23 22:48:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:48:20,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,480 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20,480 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1134888427, now seen corresponding path program 1 times [2019-11-23 22:48:20,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656117177] [2019-11-23 22:48:20,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-23 22:48:20,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656117177] [2019-11-23 22:48:20,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:20,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662654777] [2019-11-23 22:48:20,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,586 INFO L87 Difference]: Start difference. First operand 1474 states and 2183 transitions. Second operand 3 states. [2019-11-23 22:48:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,859 INFO L93 Difference]: Finished difference Result 3137 states and 4655 transitions. [2019-11-23 22:48:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:48:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,871 INFO L225 Difference]: With dead ends: 3137 [2019-11-23 22:48:20,871 INFO L226 Difference]: Without dead ends: 1670 [2019-11-23 22:48:20,875 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:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-11-23 22:48:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1554. [2019-11-23 22:48:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-23 22:48:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2243 transitions. [2019-11-23 22:48:20,937 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2243 transitions. Word has length 158 [2019-11-23 22:48:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,937 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2243 transitions. [2019-11-23 22:48:20,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2243 transitions. [2019-11-23 22:48:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 22:48:20,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,943 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:20,943 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1894065177, now seen corresponding path program 1 times [2019-11-23 22:48:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660402945] [2019-11-23 22:48:20,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 22:48:20,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660402945] [2019-11-23 22:48:20,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:20,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009349975] [2019-11-23 22:48:20,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,998 INFO L87 Difference]: Start difference. First operand 1554 states and 2243 transitions. Second operand 3 states. [2019-11-23 22:48:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:21,197 INFO L93 Difference]: Finished difference Result 3157 states and 4541 transitions. [2019-11-23 22:48:21,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:21,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 22:48:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:21,205 INFO L225 Difference]: With dead ends: 3157 [2019-11-23 22:48:21,206 INFO L226 Difference]: Without dead ends: 1610 [2019-11-23 22:48:21,208 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:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-11-23 22:48:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1554. [2019-11-23 22:48:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-23 22:48:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2181 transitions. [2019-11-23 22:48:21,266 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2181 transitions. Word has length 172 [2019-11-23 22:48:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:21,267 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2181 transitions. [2019-11-23 22:48:21,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2181 transitions. [2019-11-23 22:48:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:48:21,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:21,272 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:21,272 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash -313542519, now seen corresponding path program 1 times [2019-11-23 22:48:21,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:21,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634791343] [2019-11-23 22:48:21,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-23 22:48:21,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634791343] [2019-11-23 22:48:21,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:21,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:21,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457867791] [2019-11-23 22:48:21,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:21,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,352 INFO L87 Difference]: Start difference. First operand 1554 states and 2181 transitions. Second operand 3 states. [2019-11-23 22:48:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:21,528 INFO L93 Difference]: Finished difference Result 3186 states and 4458 transitions. [2019-11-23 22:48:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:21,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-23 22:48:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:21,536 INFO L225 Difference]: With dead ends: 3186 [2019-11-23 22:48:21,537 INFO L226 Difference]: Without dead ends: 1639 [2019-11-23 22:48:21,539 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:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-23 22:48:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-23 22:48:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-23 22:48:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2265 transitions. [2019-11-23 22:48:21,594 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2265 transitions. Word has length 188 [2019-11-23 22:48:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:21,594 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2265 transitions. [2019-11-23 22:48:21,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2265 transitions. [2019-11-23 22:48:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-23 22:48:21,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:21,600 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:21,600 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1889247393, now seen corresponding path program 1 times [2019-11-23 22:48:21,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:21,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260059720] [2019-11-23 22:48:21,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-23 22:48:21,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260059720] [2019-11-23 22:48:21,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:21,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:21,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966670472] [2019-11-23 22:48:21,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:21,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,670 INFO L87 Difference]: Start difference. First operand 1623 states and 2265 transitions. Second operand 3 states. [2019-11-23 22:48:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:21,838 INFO L93 Difference]: Finished difference Result 3391 states and 4735 transitions. [2019-11-23 22:48:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:21,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-23 22:48:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:21,847 INFO L225 Difference]: With dead ends: 3391 [2019-11-23 22:48:21,847 INFO L226 Difference]: Without dead ends: 1775 [2019-11-23 22:48:21,850 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:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-11-23 22:48:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1723. [2019-11-23 22:48:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-23 22:48:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2385 transitions. [2019-11-23 22:48:21,906 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2385 transitions. Word has length 209 [2019-11-23 22:48:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:21,906 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2385 transitions. [2019-11-23 22:48:21,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2385 transitions. [2019-11-23 22:48:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 22:48:21,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:21,913 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:21,913 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 627964964, now seen corresponding path program 1 times [2019-11-23 22:48:21,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:21,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821762852] [2019-11-23 22:48:21,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-23 22:48:22,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821762852] [2019-11-23 22:48:22,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:22,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875728472] [2019-11-23 22:48:22,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,046 INFO L87 Difference]: Start difference. First operand 1723 states and 2385 transitions. Second operand 3 states. [2019-11-23 22:48:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,259 INFO L93 Difference]: Finished difference Result 3493 states and 4821 transitions. [2019-11-23 22:48:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-23 22:48:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,269 INFO L225 Difference]: With dead ends: 3493 [2019-11-23 22:48:22,269 INFO L226 Difference]: Without dead ends: 1777 [2019-11-23 22:48:22,273 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:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-11-23 22:48:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1723. [2019-11-23 22:48:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-23 22:48:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2377 transitions. [2019-11-23 22:48:22,334 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2377 transitions. Word has length 212 [2019-11-23 22:48:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,334 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2377 transitions. [2019-11-23 22:48:22,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2377 transitions. [2019-11-23 22:48:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 22:48:22,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,340 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:22,341 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash 575806657, now seen corresponding path program 1 times [2019-11-23 22:48:22,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268980629] [2019-11-23 22:48:22,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-23 22:48:22,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268980629] [2019-11-23 22:48:22,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:22,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75014298] [2019-11-23 22:48:22,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,461 INFO L87 Difference]: Start difference. First operand 1723 states and 2377 transitions. Second operand 3 states. [2019-11-23 22:48:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,656 INFO L93 Difference]: Finished difference Result 3635 states and 5035 transitions. [2019-11-23 22:48:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-23 22:48:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,666 INFO L225 Difference]: With dead ends: 3635 [2019-11-23 22:48:22,666 INFO L226 Difference]: Without dead ends: 1819 [2019-11-23 22:48:22,670 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:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-11-23 22:48:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1779. [2019-11-23 22:48:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-23 22:48:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2421 transitions. [2019-11-23 22:48:22,726 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2421 transitions. Word has length 233 [2019-11-23 22:48:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,727 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2421 transitions. [2019-11-23 22:48:22,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2421 transitions. [2019-11-23 22:48:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-23 22:48:22,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,733 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:22,733 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 274134262, now seen corresponding path program 1 times [2019-11-23 22:48:22,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384246015] [2019-11-23 22:48:22,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-23 22:48:22,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384246015] [2019-11-23 22:48:22,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:22,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948948051] [2019-11-23 22:48:22,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,838 INFO L87 Difference]: Start difference. First operand 1779 states and 2421 transitions. Second operand 3 states. [2019-11-23 22:48:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:23,001 INFO L93 Difference]: Finished difference Result 3583 states and 4883 transitions. [2019-11-23 22:48:23,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:23,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-23 22:48:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:23,010 INFO L225 Difference]: With dead ends: 3583 [2019-11-23 22:48:23,011 INFO L226 Difference]: Without dead ends: 1811 [2019-11-23 22:48:23,013 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:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-23 22:48:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1779. [2019-11-23 22:48:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-23 22:48:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2401 transitions. [2019-11-23 22:48:23,073 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2401 transitions. Word has length 235 [2019-11-23 22:48:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:23,074 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2401 transitions. [2019-11-23 22:48:23,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2401 transitions. [2019-11-23 22:48:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 22:48:23,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:23,080 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:23,080 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2133876990, now seen corresponding path program 1 times [2019-11-23 22:48:23,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:23,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553993665] [2019-11-23 22:48:23,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-23 22:48:23,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553993665] [2019-11-23 22:48:23,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354725881] [2019-11-23 22:48:23,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:23,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:23,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-23 22:48:23,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:23,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:23,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900906231] [2019-11-23 22:48:23,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:23,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:23,524 INFO L87 Difference]: Start difference. First operand 1779 states and 2401 transitions. Second operand 3 states. [2019-11-23 22:48:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:23,636 INFO L93 Difference]: Finished difference Result 3573 states and 4829 transitions. [2019-11-23 22:48:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:23,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-23 22:48:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:23,649 INFO L225 Difference]: With dead ends: 3573 [2019-11-23 22:48:23,649 INFO L226 Difference]: Without dead ends: 2234 [2019-11-23 22:48:23,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-11-23 22:48:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2019-11-23 22:48:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-11-23 22:48:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3016 transitions. [2019-11-23 22:48:23,750 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3016 transitions. Word has length 245 [2019-11-23 22:48:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:23,750 INFO L462 AbstractCegarLoop]: Abstraction has 2234 states and 3016 transitions. [2019-11-23 22:48:23,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3016 transitions. [2019-11-23 22:48:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 22:48:23,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:23,763 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:23,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:23,970 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash -207038505, now seen corresponding path program 1 times [2019-11-23 22:48:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:23,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424621581] [2019-11-23 22:48:23,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-23 22:48:24,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424621581] [2019-11-23 22:48:24,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065414574] [2019-11-23 22:48:24,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:24,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:24,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-23 22:48:24,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:24,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:24,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531113197] [2019-11-23 22:48:24,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:24,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:24,294 INFO L87 Difference]: Start difference. First operand 2234 states and 3016 transitions. Second operand 4 states. [2019-11-23 22:48:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:24,970 INFO L93 Difference]: Finished difference Result 7148 states and 9660 transitions. [2019-11-23 22:48:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:24,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-23 22:48:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:25,019 INFO L225 Difference]: With dead ends: 7148 [2019-11-23 22:48:25,019 INFO L226 Difference]: Without dead ends: 4921 [2019-11-23 22:48:25,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2019-11-23 22:48:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 2779. [2019-11-23 22:48:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-11-23 22:48:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3666 transitions. [2019-11-23 22:48:25,175 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3666 transitions. Word has length 252 [2019-11-23 22:48:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:25,175 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3666 transitions. [2019-11-23 22:48:25,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3666 transitions. [2019-11-23 22:48:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 22:48:25,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,184 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:25,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:25,397 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 81780885, now seen corresponding path program 1 times [2019-11-23 22:48:25,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057161273] [2019-11-23 22:48:25,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-23 22:48:25,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057161273] [2019-11-23 22:48:25,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:25,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:25,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093557051] [2019-11-23 22:48:25,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:25,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:25,517 INFO L87 Difference]: Start difference. First operand 2779 states and 3666 transitions. Second operand 3 states. [2019-11-23 22:48:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:25,656 INFO L93 Difference]: Finished difference Result 7808 states and 10356 transitions. [2019-11-23 22:48:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:25,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-23 22:48:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:25,671 INFO L225 Difference]: With dead ends: 7808 [2019-11-23 22:48:25,671 INFO L226 Difference]: Without dead ends: 5036 [2019-11-23 22:48:25,676 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:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-11-23 22:48:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5034. [2019-11-23 22:48:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-23 22:48:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6686 transitions. [2019-11-23 22:48:25,851 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6686 transitions. Word has length 252 [2019-11-23 22:48:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:25,852 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6686 transitions. [2019-11-23 22:48:25,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6686 transitions. [2019-11-23 22:48:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-23 22:48:25,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,862 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:25,863 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1389751562, now seen corresponding path program 1 times [2019-11-23 22:48:25,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350070135] [2019-11-23 22:48:25,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-23 22:48:26,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350070135] [2019-11-23 22:48:26,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:26,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:26,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056823785] [2019-11-23 22:48:26,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:26,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,044 INFO L87 Difference]: Start difference. First operand 5034 states and 6686 transitions. Second operand 3 states. [2019-11-23 22:48:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,339 INFO L93 Difference]: Finished difference Result 10161 states and 13481 transitions. [2019-11-23 22:48:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:26,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-23 22:48:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,351 INFO L225 Difference]: With dead ends: 10161 [2019-11-23 22:48:26,351 INFO L226 Difference]: Without dead ends: 5134 [2019-11-23 22:48:26,362 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:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2019-11-23 22:48:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5034. [2019-11-23 22:48:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-23 22:48:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6600 transitions. [2019-11-23 22:48:26,551 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6600 transitions. Word has length 255 [2019-11-23 22:48:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6600 transitions. [2019-11-23 22:48:26,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6600 transitions. [2019-11-23 22:48:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-23 22:48:26,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,565 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:26,565 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1038896286, now seen corresponding path program 1 times [2019-11-23 22:48:26,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137148938] [2019-11-23 22:48:26,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-23 22:48:26,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137148938] [2019-11-23 22:48:26,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777694336] [2019-11-23 22:48:26,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:26,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-23 22:48:26,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:26,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:26,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893478980] [2019-11-23 22:48:26,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:26,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:26,918 INFO L87 Difference]: Start difference. First operand 5034 states and 6600 transitions. Second operand 3 states. [2019-11-23 22:48:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,179 INFO L93 Difference]: Finished difference Result 10081 states and 13209 transitions. [2019-11-23 22:48:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-23 22:48:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,191 INFO L225 Difference]: With dead ends: 10081 [2019-11-23 22:48:27,191 INFO L226 Difference]: Without dead ends: 5054 [2019-11-23 22:48:27,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-11-23 22:48:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 5034. [2019-11-23 22:48:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-23 22:48:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6590 transitions. [2019-11-23 22:48:27,360 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6590 transitions. Word has length 281 [2019-11-23 22:48:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,361 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6590 transitions. [2019-11-23 22:48:27,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6590 transitions. [2019-11-23 22:48:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-23 22:48:27,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,373 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:27,577 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1898466533, now seen corresponding path program 1 times [2019-11-23 22:48:27,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475965704] [2019-11-23 22:48:27,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-23 22:48:27,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475965704] [2019-11-23 22:48:27,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378522057] [2019-11-23 22:48:27,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:27,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-23 22:48:27,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:27,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:27,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172258186] [2019-11-23 22:48:27,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:27,829 INFO L87 Difference]: Start difference. First operand 5034 states and 6590 transitions. Second operand 3 states. [2019-11-23 22:48:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,093 INFO L93 Difference]: Finished difference Result 10061 states and 13169 transitions. [2019-11-23 22:48:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-23 22:48:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,103 INFO L225 Difference]: With dead ends: 10061 [2019-11-23 22:48:28,103 INFO L226 Difference]: Without dead ends: 5034 [2019-11-23 22:48:28,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-23 22:48:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 5034. [2019-11-23 22:48:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-23 22:48:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6580 transitions. [2019-11-23 22:48:28,243 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6580 transitions. Word has length 282 [2019-11-23 22:48:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,243 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6580 transitions. [2019-11-23 22:48:28,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6580 transitions. [2019-11-23 22:48:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-23 22:48:28,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,255 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:28,459 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 89999279, now seen corresponding path program 1 times [2019-11-23 22:48:28,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615229728] [2019-11-23 22:48:28,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-23 22:48:28,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615229728] [2019-11-23 22:48:28,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499628430] [2019-11-23 22:48:28,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:28,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-23 22:48:28,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:28,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:28,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451608325] [2019-11-23 22:48:28,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:28,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:28,738 INFO L87 Difference]: Start difference. First operand 5034 states and 6580 transitions. Second operand 4 states. [2019-11-23 22:48:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,199 INFO L93 Difference]: Finished difference Result 11805 states and 15365 transitions. [2019-11-23 22:48:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:29,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-23 22:48:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,212 INFO L225 Difference]: With dead ends: 11805 [2019-11-23 22:48:29,212 INFO L226 Difference]: Without dead ends: 6712 [2019-11-23 22:48:29,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 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:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-11-23 22:48:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 4418. [2019-11-23 22:48:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2019-11-23 22:48:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 5699 transitions. [2019-11-23 22:48:29,346 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 5699 transitions. Word has length 282 [2019-11-23 22:48:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,347 INFO L462 AbstractCegarLoop]: Abstraction has 4418 states and 5699 transitions. [2019-11-23 22:48:29,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 5699 transitions. [2019-11-23 22:48:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-23 22:48:29,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,358 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:29,562 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash -68994562, now seen corresponding path program 1 times [2019-11-23 22:48:29,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119427861] [2019-11-23 22:48:29,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-23 22:48:29,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119427861] [2019-11-23 22:48:29,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080959763] [2019-11-23 22:48:29,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,671 INFO L87 Difference]: Start difference. First operand 4418 states and 5699 transitions. Second operand 3 states. [2019-11-23 22:48:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,866 INFO L93 Difference]: Finished difference Result 7454 states and 9509 transitions. [2019-11-23 22:48:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-23 22:48:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,872 INFO L225 Difference]: With dead ends: 7454 [2019-11-23 22:48:29,872 INFO L226 Difference]: Without dead ends: 2235 [2019-11-23 22:48:29,878 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:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2019-11-23 22:48:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2019-11-23 22:48:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-11-23 22:48:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2837 transitions. [2019-11-23 22:48:29,942 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2837 transitions. Word has length 320 [2019-11-23 22:48:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,943 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2837 transitions. [2019-11-23 22:48:29,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2837 transitions. [2019-11-23 22:48:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-23 22:48:29,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,948 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,949 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash 439442017, now seen corresponding path program 1 times [2019-11-23 22:48:29,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251230336] [2019-11-23 22:48:29,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-23 22:48:30,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251230336] [2019-11-23 22:48:30,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624858598] [2019-11-23 22:48:30,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,094 INFO L87 Difference]: Start difference. First operand 2235 states and 2837 transitions. Second operand 3 states. [2019-11-23 22:48:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,289 INFO L93 Difference]: Finished difference Result 4473 states and 5673 transitions. [2019-11-23 22:48:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-23 22:48:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,294 INFO L225 Difference]: With dead ends: 4473 [2019-11-23 22:48:30,294 INFO L226 Difference]: Without dead ends: 2245 [2019-11-23 22:48:30,297 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:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-23 22:48:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2235. [2019-11-23 22:48:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-11-23 22:48:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2812 transitions. [2019-11-23 22:48:30,350 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2812 transitions. Word has length 359 [2019-11-23 22:48:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,351 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2812 transitions. [2019-11-23 22:48:30,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2812 transitions. [2019-11-23 22:48:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-23 22:48:30,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,355 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,356 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1924130447, now seen corresponding path program 1 times [2019-11-23 22:48:30,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954152436] [2019-11-23 22:48:30,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-23 22:48:30,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954152436] [2019-11-23 22:48:30,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653227602] [2019-11-23 22:48:30,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:30,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-23 22:48:30,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:30,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:30,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519681560] [2019-11-23 22:48:30,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:30,774 INFO L87 Difference]: Start difference. First operand 2235 states and 2812 transitions. Second operand 3 states. [2019-11-23 22:48:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,852 INFO L93 Difference]: Finished difference Result 2854 states and 3617 transitions. [2019-11-23 22:48:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-23 22:48:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,858 INFO L225 Difference]: With dead ends: 2854 [2019-11-23 22:48:30,858 INFO L226 Difference]: Without dead ends: 2762 [2019-11-23 22:48:30,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-11-23 22:48:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2145. [2019-11-23 22:48:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-11-23 22:48:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2711 transitions. [2019-11-23 22:48:30,912 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2711 transitions. Word has length 392 [2019-11-23 22:48:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,913 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 2711 transitions. [2019-11-23 22:48:30,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2711 transitions. [2019-11-23 22:48:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-23 22:48:30,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,919 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:48:31,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:31,125 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash -820757555, now seen corresponding path program 1 times [2019-11-23 22:48:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767552242] [2019-11-23 22:48:31,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-11-23 22:48:31,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767552242] [2019-11-23 22:48:31,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373291873] [2019-11-23 22:48:31,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:31,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-11-23 22:48:31,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:31,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:31,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977125320] [2019-11-23 22:48:31,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:31,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:31,869 INFO L87 Difference]: Start difference. First operand 2145 states and 2711 transitions. Second operand 4 states. [2019-11-23 22:48:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,215 INFO L93 Difference]: Finished difference Result 5211 states and 6595 transitions. [2019-11-23 22:48:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:32,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-11-23 22:48:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,225 INFO L225 Difference]: With dead ends: 5211 [2019-11-23 22:48:32,225 INFO L226 Difference]: Without dead ends: 3031 [2019-11-23 22:48:32,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 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:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2019-11-23 22:48:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2205. [2019-11-23 22:48:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-23 22:48:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2791 transitions. [2019-11-23 22:48:32,310 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2791 transitions. Word has length 532 [2019-11-23 22:48:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,311 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 2791 transitions. [2019-11-23 22:48:32,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2791 transitions. [2019-11-23 22:48:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-11-23 22:48:32,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,319 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:48:32,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:32,533 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash -751360217, now seen corresponding path program 1 times [2019-11-23 22:48:32,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896360826] [2019-11-23 22:48:32,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-11-23 22:48:32,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896360826] [2019-11-23 22:48:32,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:32,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793617172] [2019-11-23 22:48:32,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,959 INFO L87 Difference]: Start difference. First operand 2205 states and 2791 transitions. Second operand 3 states. [2019-11-23 22:48:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,131 INFO L93 Difference]: Finished difference Result 4583 states and 5811 transitions. [2019-11-23 22:48:33,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 594 [2019-11-23 22:48:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,136 INFO L225 Difference]: With dead ends: 4583 [2019-11-23 22:48:33,137 INFO L226 Difference]: Without dead ends: 2385 [2019-11-23 22:48:33,139 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:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-11-23 22:48:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2375. [2019-11-23 22:48:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2019-11-23 22:48:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2986 transitions. [2019-11-23 22:48:33,205 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2986 transitions. Word has length 594 [2019-11-23 22:48:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,205 INFO L462 AbstractCegarLoop]: Abstraction has 2375 states and 2986 transitions. [2019-11-23 22:48:33,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2986 transitions. [2019-11-23 22:48:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-11-23 22:48:33,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,212 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:33,213 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1835833869, now seen corresponding path program 1 times [2019-11-23 22:48:33,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102250491] [2019-11-23 22:48:33,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-11-23 22:48:33,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102250491] [2019-11-23 22:48:33,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:33,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:33,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343358566] [2019-11-23 22:48:33,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,503 INFO L87 Difference]: Start difference. First operand 2375 states and 2986 transitions. Second operand 3 states. [2019-11-23 22:48:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,705 INFO L93 Difference]: Finished difference Result 4738 states and 5951 transitions. [2019-11-23 22:48:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2019-11-23 22:48:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,710 INFO L225 Difference]: With dead ends: 4738 [2019-11-23 22:48:33,710 INFO L226 Difference]: Without dead ends: 2370 [2019-11-23 22:48:33,713 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:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-11-23 22:48:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2370. [2019-11-23 22:48:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-11-23 22:48:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2931 transitions. [2019-11-23 22:48:33,773 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2931 transitions. Word has length 656 [2019-11-23 22:48:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,774 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 2931 transitions. [2019-11-23 22:48:33,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2931 transitions. [2019-11-23 22:48:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-11-23 22:48:33,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,785 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:33,786 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1388787143, now seen corresponding path program 1 times [2019-11-23 22:48:33,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017737603] [2019-11-23 22:48:33,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-11-23 22:48:34,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017737603] [2019-11-23 22:48:34,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481152451] [2019-11-23 22:48:34,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:34,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-11-23 22:48:34,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:34,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:34,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046865581] [2019-11-23 22:48:34,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:34,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:34,681 INFO L87 Difference]: Start difference. First operand 2370 states and 2931 transitions. Second operand 4 states. [2019-11-23 22:48:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,883 INFO L93 Difference]: Finished difference Result 4080 states and 5087 transitions. [2019-11-23 22:48:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:34,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 722 [2019-11-23 22:48:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,885 INFO L225 Difference]: With dead ends: 4080 [2019-11-23 22:48:34,885 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:48:34,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 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:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:48:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:48:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:48:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:48:34,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 722 [2019-11-23 22:48:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,892 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:48:34,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:48:34,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:48:35,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:35,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:48:35,496 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 131 [2019-11-23 22:48:35,686 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-23 22:48:36,763 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-11-23 22:48:37,851 WARN L192 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-11-23 22:48:38,284 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-23 22:48:38,691 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-23 22:48:39,095 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 34 [2019-11-23 22:48:39,947 WARN L192 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 49 [2019-11-23 22:48:40,240 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2019-11-23 22:48:40,571 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-11-23 22:48:44,610 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 212 DAG size of output: 110 [2019-11-23 22:48:44,980 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-11-23 22:48:45,264 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-11-23 22:48:45,529 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-23 22:48:45,841 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-23 22:48:46,188 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-23 22:48:46,529 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-23 22:48:46,841 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-23 22:48:47,053 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-11-23 22:48:47,394 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-23 22:48:47,825 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 24 [2019-11-23 22:48:51,559 WARN L192 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 212 DAG size of output: 110 [2019-11-23 22:48:51,915 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-23 22:48:52,172 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 19 [2019-11-23 22:48:52,544 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-11-23 22:48:52,548 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 435) no Hoare annotation was computed. [2019-11-23 22:48:52,548 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 371) no Hoare annotation was computed. [2019-11-23 22:48:52,549 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse0 .cse1 .cse2 .cse3))) [2019-11-23 22:48:52,549 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-23 22:48:52,549 INFO L447 ceAbstractionStarter]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-23 22:48:52,549 INFO L444 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L440 ceAbstractionStarter]: At program point L400(lines 391 409) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,550 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 370) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L444 ceAbstractionStarter]: For program point L336-1(lines 336 370) no Hoare annotation was computed. [2019-11-23 22:48:52,550 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-23 22:48:52,551 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,551 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-23 22:48:52,551 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 471) no Hoare annotation was computed. [2019-11-23 22:48:52,551 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-11-23 22:48:52,551 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 367) no Hoare annotation was computed. [2019-11-23 22:48:52,551 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-23 22:48:52,552 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 314) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 365) no Hoare annotation was computed. [2019-11-23 22:48:52,553 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-23 22:48:52,554 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9))) [2019-11-23 22:48:52,554 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,554 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5))) [2019-11-23 22:48:52,554 INFO L447 ceAbstractionStarter]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-23 22:48:52,555 INFO L440 ceAbstractionStarter]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse11 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse20 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not .cse29)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse19 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (not .cse10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10) (and .cse3 .cse11 .cse12) (and .cse13 .cse14) (and .cse3 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse15 .cse11 .cse18 .cse19) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse20 .cse14 .cse21 .cse22) (and .cse5 .cse6 .cse0 .cse8 .cse1 .cse23 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse10) (and .cse15 .cse0 .cse18 .cse19) (and .cse3 .cse0 .cse12) (and .cse5 .cse6 .cse11 .cse1 .cse23 .cse9) (and .cse4 .cse3 .cse1 .cse2) (and .cse4 .cse13) (and .cse5 .cse6 .cse7 .cse11 .cse1 .cse9) (and .cse5 .cse11 .cse24 .cse25 .cse26 .cse20 .cse12 .cse27 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse10) (and .cse4 .cse3 .cse28 .cse19) (and .cse4 .cse1 .cse2 .cse22) (and .cse11 .cse1 .cse2) (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse20 .cse21 .cse10) (and .cse5 .cse24 .cse25 .cse0 .cse26 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse12 .cse27 .cse9) (and .cse16 .cse28 .cse14 .cse19 .cse22) (and .cse5 .cse6 .cse7 .cse0 .cse8 .cse1 .cse9) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse1 .cse23 .cse9 .cse10) (and .cse14 .cse1 .cse2 .cse22) (and .cse4 .cse29 .cse10) (and .cse4 .cse3 .cse12 .cse10) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse4 .cse28 .cse19 .cse22)))) [2019-11-23 22:48:52,555 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 445) no Hoare annotation was computed. [2019-11-23 22:48:52,555 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-23 22:48:52,555 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-23 22:48:52,555 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 411) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 455) no Hoare annotation was computed. [2019-11-23 22:48:52,556 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 386) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-23 22:48:52,557 INFO L440 ceAbstractionStarter]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-23 22:48:52,558 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,558 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5))) [2019-11-23 22:48:52,558 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-23 22:48:52,558 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:48:52,558 INFO L444 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-23 22:48:52,558 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-11-23 22:48:52,558 INFO L444 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-11-23 22:48:52,558 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 452) no Hoare annotation was computed. [2019-11-23 22:48:52,559 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 361) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-23 22:48:52,560 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-23 22:48:52,561 INFO L444 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-23 22:48:52,561 INFO L440 ceAbstractionStarter]: At program point L354(lines 330 372) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5))) [2019-11-23 22:48:52,561 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1))) [2019-11-23 22:48:52,561 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,561 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-23 22:48:52,561 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point L421(lines 421 423) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L440 ceAbstractionStarter]: At program point L388(lines 379 411) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L447 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-23 22:48:52,562 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L324-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 409) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:48:52,563 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-11-23 22:48:52,564 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-11-23 22:48:52,564 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-23 22:48:52,564 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-23 22:48:52,564 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-23 22:48:52,564 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-23 22:48:52,564 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 .cse4))) [2019-11-23 22:48:52,564 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-11-23 22:48:52,564 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-23 22:48:52,565 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 300) no Hoare annotation was computed. [2019-11-23 22:48:52,565 INFO L444 ceAbstractionStarter]: For program point L296-2(lines 296 300) no Hoare annotation was computed. [2019-11-23 22:48:52,565 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-23 22:48:52,565 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-23 22:48:52,565 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-23 22:48:52,565 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse11 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse20 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not .cse29)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse19 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (not .cse10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10) (and .cse3 .cse11 .cse12) (and .cse13 .cse14) (and .cse3 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse15 .cse11 .cse18 .cse19) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse20 .cse14 .cse21 .cse22) (and .cse5 .cse6 .cse0 .cse8 .cse1 .cse23 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse10) (and .cse15 .cse0 .cse18 .cse19) (and .cse3 .cse0 .cse12) (and .cse5 .cse6 .cse11 .cse1 .cse23 .cse9) (and .cse4 .cse3 .cse1 .cse2) (and .cse4 .cse13) (and .cse5 .cse6 .cse7 .cse11 .cse1 .cse9) (and .cse5 .cse11 .cse24 .cse25 .cse26 .cse20 .cse12 .cse27 .cse9) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse10) (and .cse4 .cse3 .cse28 .cse19) (and .cse4 .cse1 .cse2 .cse22) (and .cse11 .cse1 .cse2) (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse20 .cse21 .cse10) (and .cse5 .cse24 .cse25 .cse0 .cse26 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse12 .cse27 .cse9) (and .cse16 .cse28 .cse14 .cse19 .cse22) (and .cse5 .cse6 .cse7 .cse0 .cse8 .cse1 .cse9) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse1 .cse23 .cse9 .cse10) (and .cse14 .cse1 .cse2 .cse22) (and .cse4 .cse29 .cse10) (and .cse4 .cse3 .cse12 .cse10) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse4 .cse28 .cse19 .cse22)))) [2019-11-23 22:48:52,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-23 22:48:52,566 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 429 437) no Hoare annotation was computed. [2019-11-23 22:48:52,566 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-23 22:48:52,566 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)))) [2019-11-23 22:48:52,566 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-23 22:48:52,566 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-23 22:48:52,567 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-23 22:48:52,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:52 BoogieIcfgContainer [2019-11-23 22:48:52,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:52,615 INFO L168 Benchmark]: Toolchain (without parser) took 38784.24 ms. Allocated memory was 144.7 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.8 MB in the beginning and 432.0 MB in the end (delta: -330.1 MB). Peak memory consumption was 970.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,615 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.19 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 177.5 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 201.9 MB. Free memory was 177.5 MB in the beginning and 174.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,616 INFO L168 Benchmark]: Boogie Preprocessor took 41.13 ms. Allocated memory is still 201.9 MB. Free memory was 174.1 MB in the beginning and 172.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,617 INFO L168 Benchmark]: RCFGBuilder took 892.57 ms. Allocated memory is still 201.9 MB. Free memory was 172.0 MB in the beginning and 118.3 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,617 INFO L168 Benchmark]: TraceAbstraction took 37273.16 ms. Allocated memory was 201.9 MB in the beginning and 1.2 GB in the end (delta: 966.3 MB). Free memory was 117.6 MB in the beginning and 432.0 MB in the end (delta: -314.4 MB). Peak memory consumption was 929.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:52,619 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.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 513.19 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 177.5 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 201.9 MB. Free memory was 177.5 MB in the beginning and 174.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.13 ms. Allocated memory is still 201.9 MB. Free memory was 174.1 MB in the beginning and 172.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 892.57 ms. Allocated memory is still 201.9 MB. Free memory was 172.0 MB in the beginning and 118.3 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37273.16 ms. Allocated memory was 201.9 MB in the beginning and 1.2 GB in the end (delta: 966.3 MB). Free memory was 117.6 MB in the beginning and 432.0 MB in the end (delta: -314.4 MB). Peak memory consumption was 929.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545))) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545))) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8656) && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) || (((((blastFlag <= 3 && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && !(0 == s__hit))) || ((((1 == blastFlag && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292))) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((0 == blastFlag && s__state <= 8640) && 8640 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && s__state == 8592) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state)) || (((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (((((!(s__state == 8561) && 8512 <= s__state) && 1 == blastFlag) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 1 == blastFlag) && s__state <= 8640) && !(s__state == 8545))) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656) && 8656 <= s__state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((blastFlag <= 2 && s__state == 8560) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8544)) && 1 == blastFlag) && s__state <= 8576) && !(s__state == 8545)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit)) || ((((8512 <= s__state && !(s__state == 8544)) && 0 == blastFlag) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545))) || (((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8561)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) || ((((8512 <= s__state && !(s__state == 8561)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit)) || (((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8672)) && 8656 <= s__state)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8656 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8561)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) || ((((8512 <= s__state && !(s__state == 8561)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && 8448 <= s__state) && s__state <= 8448) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && !(s__state == 8561)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) || ((((8512 <= s__state && !(s__state == 8561)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576)) || (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && s__state <= 8640) && 8640 <= s__state) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((0 == blastFlag && s__state <= 8640) && 8640 <= s__state) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && s__state == 8592) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545)) && 0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state)) || (((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (((((!(s__state == 8561) && 8512 <= s__state) && 1 == blastFlag) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || (blastFlag <= 2 && s__state <= 3)) || (((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 1 == blastFlag) && s__state <= 8640) && !(s__state == 8545))) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656) && 8656 <= s__state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit))) || ((((((!(s__state == 8561) && 8512 <= s__state) && s__state == 8592) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8545))) || ((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((blastFlag <= 2 && s__state == 8560) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8656)) && !(s__state == 8657)) && 8656 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 0 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545))) || ((((((!(s__state == 8561) && 8512 <= s__state) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((1 == blastFlag && s__state == 8608) || (0 == blastFlag && s__state == 8608)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && s__state == 8608) && 0 == s__hit) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 37.1s, OverallIterations: 39, TraceHistogramMax: 24, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.4s, HoareTripleCheckerStatistics: 7340 SDtfs, 4454 SDslu, 3443 SDs, 0 SdLazy, 3925 SolverSat, 1034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3099 GetRequests, 3043 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5034occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 6479 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2673 HoareAnnotationTreeSize, 28 FomulaSimplifications, 260465 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 28 FomulaSimplificationsInter, 105781 FormulaSimplificationTreeSizeReductionInter, 14.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 11530 NumberOfCodeBlocks, 11530 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11483 ConstructedInterpolants, 0 QuantifiedInterpolants, 5269159 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4812 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...