./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1236ee922960b2737aa65707c3f9d27b28eaa4fc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:08:27,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:08:27,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:08:27,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:08:27,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:08:27,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:08:27,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:08:27,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:08:27,553 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:08:27,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:08:27,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:08:27,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:08:27,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:08:27,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:08:27,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:08:27,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:08:27,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:08:27,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:08:27,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:08:27,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:08:27,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:08:27,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:08:27,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:08:27,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:08:27,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:08:27,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:08:27,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:08:27,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:08:27,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:08:27,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:08:27,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:08:27,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:08:27,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:08:27,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:08:27,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:08:27,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:08:27,593 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:08:27,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:08:27,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:08:27,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:08:27,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:08:27,623 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:08:27,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:08:27,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:08:27,625 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:08:27,625 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:08:27,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:08:27,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:08:27,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:08:27,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:08:27,626 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:08:27,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:08:27,626 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:08:27,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:08:27,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:08:27,627 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:08:27,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:08:27,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:08:27,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:27,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:08:27,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:08:27,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:08:27,629 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:08:27,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:08:27,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:08:27,631 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2018-12-30 16:08:27,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:08:27,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:08:27,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:08:27,700 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:08:27,701 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:08:27,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:27,773 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5cf833e4/8d2b010a64344542b3293ce3a4b9d459/FLAGd6404fc05 [2018-12-30 16:08:28,267 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:08:28,268 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:28,279 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5cf833e4/8d2b010a64344542b3293ce3a4b9d459/FLAGd6404fc05 [2018-12-30 16:08:28,597 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5cf833e4/8d2b010a64344542b3293ce3a4b9d459 [2018-12-30 16:08:28,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:08:28,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:08:28,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:28,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:08:28,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:08:28,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:28" (1/1) ... [2018-12-30 16:08:28,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517a1aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:28, skipping insertion in model container [2018-12-30 16:08:28,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:28" (1/1) ... [2018-12-30 16:08:28,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:08:28,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:08:29,018 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:29,026 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:08:29,088 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:29,105 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:08:29,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29 WrapperNode [2018-12-30 16:08:29,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:29,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:29,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:08:29,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:08:29,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:29,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:08:29,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:08:29,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:08:29,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (1/1) ... [2018-12-30 16:08:29,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:08:29,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:08:29,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:08:29,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:08:29,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (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 [2018-12-30 16:08:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:08:29,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:08:29,498 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:08:29,498 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:08:30,605 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:08:30,605 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:08:30,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:30 BoogieIcfgContainer [2018-12-30 16:08:30,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:08:30,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:08:30,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:08:30,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:08:30,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:08:28" (1/3) ... [2018-12-30 16:08:30,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f094d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:30, skipping insertion in model container [2018-12-30 16:08:30,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:29" (2/3) ... [2018-12-30 16:08:30,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f094d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:30, skipping insertion in model container [2018-12-30 16:08:30,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:30" (3/3) ... [2018-12-30 16:08:30,613 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:30,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:08:30,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:08:30,650 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:08:30,692 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:08:30,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:08:30,693 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:08:30,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:08:30,694 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:08:30,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:08:30,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:08:30,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:08:30,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:08:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-12-30 16:08:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:08:30,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:30,724 INFO L402 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] [2018-12-30 16:08:30,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2018-12-30 16:08:30,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:30,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:30,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:30,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:30,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:30,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:30,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:30,986 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-12-30 16:08:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:31,402 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2018-12-30 16:08:31,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:31,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:08:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:31,419 INFO L225 Difference]: With dead ends: 251 [2018-12-30 16:08:31,419 INFO L226 Difference]: Without dead ends: 114 [2018-12-30 16:08:31,423 INFO L631 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 [2018-12-30 16:08:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-30 16:08:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-30 16:08:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-30 16:08:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2018-12-30 16:08:31,475 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2018-12-30 16:08:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:31,475 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2018-12-30 16:08:31,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2018-12-30 16:08:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:08:31,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:31,478 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:31,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2018-12-30 16:08:31,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:31,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:31,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:31,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:31,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:31,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:31,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:31,597 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2018-12-30 16:08:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:32,159 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2018-12-30 16:08:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:32,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-30 16:08:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:32,165 INFO L225 Difference]: With dead ends: 238 [2018-12-30 16:08:32,165 INFO L226 Difference]: Without dead ends: 133 [2018-12-30 16:08:32,167 INFO L631 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 [2018-12-30 16:08:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-30 16:08:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-30 16:08:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-30 16:08:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2018-12-30 16:08:32,181 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2018-12-30 16:08:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:32,181 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2018-12-30 16:08:32,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2018-12-30 16:08:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 16:08:32,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:32,185 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:32,185 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2018-12-30 16:08:32,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:32,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:08:32,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:32,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:32,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:32,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,346 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2018-12-30 16:08:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:32,596 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2018-12-30 16:08:32,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:32,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-30 16:08:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:32,601 INFO L225 Difference]: With dead ends: 270 [2018-12-30 16:08:32,601 INFO L226 Difference]: Without dead ends: 150 [2018-12-30 16:08:32,602 INFO L631 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 [2018-12-30 16:08:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-30 16:08:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-12-30 16:08:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-30 16:08:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2018-12-30 16:08:32,615 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2018-12-30 16:08:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:32,615 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2018-12-30 16:08:32,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2018-12-30 16:08:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:08:32,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:32,618 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:32,618 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2018-12-30 16:08:32,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:32,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:32,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:32,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:32,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,736 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2018-12-30 16:08:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:33,159 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2018-12-30 16:08:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:33,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:08:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:33,163 INFO L225 Difference]: With dead ends: 334 [2018-12-30 16:08:33,164 INFO L226 Difference]: Without dead ends: 196 [2018-12-30 16:08:33,165 INFO L631 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 [2018-12-30 16:08:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-30 16:08:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2018-12-30 16:08:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-30 16:08:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2018-12-30 16:08:33,179 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2018-12-30 16:08:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:33,180 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2018-12-30 16:08:33,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2018-12-30 16:08:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:08:33,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:33,183 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:33,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2018-12-30 16:08:33,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:33,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:33,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:33,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:33,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:33,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:33,289 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2018-12-30 16:08:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:33,562 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2018-12-30 16:08:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:33,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:08:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:33,566 INFO L225 Difference]: With dead ends: 389 [2018-12-30 16:08:33,566 INFO L226 Difference]: Without dead ends: 211 [2018-12-30 16:08:33,567 INFO L631 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 [2018-12-30 16:08:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-30 16:08:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-12-30 16:08:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-30 16:08:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2018-12-30 16:08:33,580 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2018-12-30 16:08:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:33,581 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2018-12-30 16:08:33,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2018-12-30 16:08:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:08:33,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:33,584 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:33,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2018-12-30 16:08:33,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:33,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 16:08:33,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:33,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:33,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:33,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:33,693 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2018-12-30 16:08:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:33,900 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2018-12-30 16:08:33,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:33,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:08:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:33,903 INFO L225 Difference]: With dead ends: 427 [2018-12-30 16:08:33,903 INFO L226 Difference]: Without dead ends: 230 [2018-12-30 16:08:33,904 INFO L631 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 [2018-12-30 16:08:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-30 16:08:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-12-30 16:08:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-30 16:08:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2018-12-30 16:08:33,915 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2018-12-30 16:08:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:33,916 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2018-12-30 16:08:33,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2018-12-30 16:08:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:08:33,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:33,920 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:33,920 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2018-12-30 16:08:33,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-30 16:08:34,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:34,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:34,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:34,079 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2018-12-30 16:08:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:34,149 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2018-12-30 16:08:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:34,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:08:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:34,160 INFO L225 Difference]: With dead ends: 661 [2018-12-30 16:08:34,166 INFO L226 Difference]: Without dead ends: 443 [2018-12-30 16:08:34,167 INFO L631 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 [2018-12-30 16:08:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-30 16:08:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-12-30 16:08:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-30 16:08:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2018-12-30 16:08:34,203 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2018-12-30 16:08:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:34,206 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2018-12-30 16:08:34,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2018-12-30 16:08:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-30 16:08:34,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:34,214 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:34,214 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2018-12-30 16:08:34,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:34,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:34,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:08:34,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:34,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:34,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:34,394 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2018-12-30 16:08:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:34,634 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2018-12-30 16:08:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:34,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-12-30 16:08:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:34,640 INFO L225 Difference]: With dead ends: 661 [2018-12-30 16:08:34,640 INFO L226 Difference]: Without dead ends: 659 [2018-12-30 16:08:34,642 INFO L631 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 [2018-12-30 16:08:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-30 16:08:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2018-12-30 16:08:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-12-30 16:08:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2018-12-30 16:08:34,669 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2018-12-30 16:08:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:34,670 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2018-12-30 16:08:34,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2018-12-30 16:08:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-30 16:08:34,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:34,673 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:34,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2018-12-30 16:08:34,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:34,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-30 16:08:34,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:34,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:34,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:34,795 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2018-12-30 16:08:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:36,392 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2018-12-30 16:08:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:36,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-30 16:08:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:36,397 INFO L225 Difference]: With dead ends: 1462 [2018-12-30 16:08:36,397 INFO L226 Difference]: Without dead ends: 809 [2018-12-30 16:08:36,398 INFO L631 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 [2018-12-30 16:08:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-12-30 16:08:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2018-12-30 16:08:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-30 16:08:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2018-12-30 16:08:36,419 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2018-12-30 16:08:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:36,420 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2018-12-30 16:08:36,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2018-12-30 16:08:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-30 16:08:36,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:36,423 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:36,423 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2018-12-30 16:08:36,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:36,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-30 16:08:36,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:36,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:36,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:36,529 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2018-12-30 16:08:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:37,252 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2018-12-30 16:08:37,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:37,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-12-30 16:08:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:37,258 INFO L225 Difference]: With dead ends: 1824 [2018-12-30 16:08:37,258 INFO L226 Difference]: Without dead ends: 1006 [2018-12-30 16:08:37,260 INFO L631 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 [2018-12-30 16:08:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-12-30 16:08:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2018-12-30 16:08:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-12-30 16:08:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2018-12-30 16:08:37,287 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2018-12-30 16:08:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:37,287 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2018-12-30 16:08:37,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2018-12-30 16:08:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-30 16:08:37,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:37,292 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:37,292 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2018-12-30 16:08:37,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:37,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 16:08:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-30 16:08:37,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:37,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:37,408 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2018-12-30 16:08:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:37,962 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2018-12-30 16:08:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:37,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-12-30 16:08:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:37,969 INFO L225 Difference]: With dead ends: 2080 [2018-12-30 16:08:37,969 INFO L226 Difference]: Without dead ends: 1079 [2018-12-30 16:08:37,971 INFO L631 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 [2018-12-30 16:08:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2018-12-30 16:08:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2018-12-30 16:08:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-12-30 16:08:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2018-12-30 16:08:37,998 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2018-12-30 16:08:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:37,999 INFO L480 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2018-12-30 16:08:37,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2018-12-30 16:08:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-30 16:08:38,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:38,005 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:38,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2018-12-30 16:08:38,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:38,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-12-30 16:08:38,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:38,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:38,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:38,148 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2018-12-30 16:08:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:38,514 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2018-12-30 16:08:38,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:38,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-12-30 16:08:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:38,521 INFO L225 Difference]: With dead ends: 2230 [2018-12-30 16:08:38,522 INFO L226 Difference]: Without dead ends: 1160 [2018-12-30 16:08:38,523 INFO L631 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 [2018-12-30 16:08:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-12-30 16:08:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2018-12-30 16:08:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-12-30 16:08:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2018-12-30 16:08:38,555 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2018-12-30 16:08:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:38,556 INFO L480 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2018-12-30 16:08:38,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2018-12-30 16:08:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-30 16:08:38,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:38,562 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:38,562 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2018-12-30 16:08:38,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:38,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:38,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:38,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-12-30 16:08:38,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:38,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:38,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:38,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:38,714 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2018-12-30 16:08:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:40,156 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2018-12-30 16:08:40,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:40,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-12-30 16:08:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:40,165 INFO L225 Difference]: With dead ends: 2398 [2018-12-30 16:08:40,165 INFO L226 Difference]: Without dead ends: 1256 [2018-12-30 16:08:40,168 INFO L631 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 [2018-12-30 16:08:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2018-12-30 16:08:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2018-12-30 16:08:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-12-30 16:08:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2018-12-30 16:08:40,201 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2018-12-30 16:08:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:40,201 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-12-30 16:08:40,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2018-12-30 16:08:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-30 16:08:40,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:40,208 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:40,209 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2018-12-30 16:08:40,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:40,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-12-30 16:08:40,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:40,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:40,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,316 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2018-12-30 16:08:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:40,397 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2018-12-30 16:08:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:40,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2018-12-30 16:08:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:40,409 INFO L225 Difference]: With dead ends: 3630 [2018-12-30 16:08:40,409 INFO L226 Difference]: Without dead ends: 2422 [2018-12-30 16:08:40,412 INFO L631 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 [2018-12-30 16:08:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-12-30 16:08:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2018-12-30 16:08:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2018-12-30 16:08:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2018-12-30 16:08:40,471 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2018-12-30 16:08:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:40,472 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2018-12-30 16:08:40,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2018-12-30 16:08:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-30 16:08:40,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:40,480 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:40,481 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2018-12-30 16:08:40,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-12-30 16:08:40,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:40,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:40,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:40,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,579 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2018-12-30 16:08:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:40,932 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2018-12-30 16:08:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:40,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2018-12-30 16:08:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:40,947 INFO L225 Difference]: With dead ends: 5143 [2018-12-30 16:08:40,947 INFO L226 Difference]: Without dead ends: 2702 [2018-12-30 16:08:40,952 INFO L631 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 [2018-12-30 16:08:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2018-12-30 16:08:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2018-12-30 16:08:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-12-30 16:08:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2018-12-30 16:08:41,037 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2018-12-30 16:08:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:41,037 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2018-12-30 16:08:41,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2018-12-30 16:08:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-12-30 16:08:41,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:41,048 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:41,048 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2018-12-30 16:08:41,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:41,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-12-30 16:08:41,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:41,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:41,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:41,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,246 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2018-12-30 16:08:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:42,223 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2018-12-30 16:08:42,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:42,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-12-30 16:08:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:42,241 INFO L225 Difference]: With dead ends: 5335 [2018-12-30 16:08:42,241 INFO L226 Difference]: Without dead ends: 2696 [2018-12-30 16:08:42,245 INFO L631 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 [2018-12-30 16:08:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2018-12-30 16:08:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2018-12-30 16:08:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2018-12-30 16:08:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2018-12-30 16:08:42,309 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2018-12-30 16:08:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:42,310 INFO L480 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2018-12-30 16:08:42,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2018-12-30 16:08:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-12-30 16:08:42,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:42,320 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:42,320 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2018-12-30 16:08:42,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:42,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-12-30 16:08:42,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:42,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:42,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:42,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:42,460 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2018-12-30 16:08:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:42,945 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2018-12-30 16:08:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:42,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2018-12-30 16:08:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:42,959 INFO L225 Difference]: With dead ends: 5299 [2018-12-30 16:08:42,959 INFO L226 Difference]: Without dead ends: 2684 [2018-12-30 16:08:42,964 INFO L631 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 [2018-12-30 16:08:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2018-12-30 16:08:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2018-12-30 16:08:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2018-12-30 16:08:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2018-12-30 16:08:43,024 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2018-12-30 16:08:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:43,025 INFO L480 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2018-12-30 16:08:43,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2018-12-30 16:08:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-12-30 16:08:43,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:43,036 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:43,036 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2018-12-30 16:08:43,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:43,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:43,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:43,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:43,172 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2018-12-30 16:08:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:43,434 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2018-12-30 16:08:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:43,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2018-12-30 16:08:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:43,446 INFO L225 Difference]: With dead ends: 5545 [2018-12-30 16:08:43,447 INFO L226 Difference]: Without dead ends: 2930 [2018-12-30 16:08:43,451 INFO L631 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 [2018-12-30 16:08:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2018-12-30 16:08:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2018-12-30 16:08:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-12-30 16:08:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2018-12-30 16:08:43,512 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2018-12-30 16:08:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:43,513 INFO L480 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2018-12-30 16:08:43,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2018-12-30 16:08:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-30 16:08:43,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:43,521 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:43,521 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2018-12-30 16:08:43,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:43,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:43,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:43,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:43,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-12-30 16:08:43,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:43,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:43,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:43,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:43,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:43,731 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2018-12-30 16:08:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:43,936 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2018-12-30 16:08:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:43,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-12-30 16:08:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:43,964 INFO L225 Difference]: With dead ends: 7734 [2018-12-30 16:08:43,970 INFO L226 Difference]: Without dead ends: 5029 [2018-12-30 16:08:43,975 INFO L631 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 [2018-12-30 16:08:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2018-12-30 16:08:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2018-12-30 16:08:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2018-12-30 16:08:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2018-12-30 16:08:44,091 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2018-12-30 16:08:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:44,092 INFO L480 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2018-12-30 16:08:44,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2018-12-30 16:08:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-30 16:08:44,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:44,103 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:44,104 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2018-12-30 16:08:44,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:44,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:44,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-12-30 16:08:44,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:44,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:44,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:44,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-12-30 16:08:44,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:44,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:44,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:44,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:44,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:44,805 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2018-12-30 16:08:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:48,421 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2018-12-30 16:08:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:08:48,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2018-12-30 16:08:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:48,456 INFO L225 Difference]: With dead ends: 9987 [2018-12-30 16:08:48,456 INFO L226 Difference]: Without dead ends: 7540 [2018-12-30 16:08:48,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2018-12-30 16:08:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2018-12-30 16:08:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2018-12-30 16:08:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2018-12-30 16:08:48,633 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2018-12-30 16:08:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:48,634 INFO L480 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2018-12-30 16:08:48,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2018-12-30 16:08:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-12-30 16:08:48,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:48,646 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:48,646 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2018-12-30 16:08:48,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:48,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:48,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:48,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:48,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:48,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 16:08:49,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 16:08:49,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 16:08:49,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:49,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:49,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:49,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:49,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:49,246 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2018-12-30 16:08:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:50,748 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2018-12-30 16:08:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:08:50,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2018-12-30 16:08:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:50,768 INFO L225 Difference]: With dead ends: 12544 [2018-12-30 16:08:50,769 INFO L226 Difference]: Without dead ends: 6979 [2018-12-30 16:08:50,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2018-12-30 16:08:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2018-12-30 16:08:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-12-30 16:08:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2018-12-30 16:08:50,929 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2018-12-30 16:08:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:50,931 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2018-12-30 16:08:50,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2018-12-30 16:08:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-12-30 16:08:50,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:50,942 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:50,943 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2018-12-30 16:08:50,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:50,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 16:08:50,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-30 16:08:51,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:51,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:51,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:51,140 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2018-12-30 16:08:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:52,263 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2018-12-30 16:08:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:52,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2018-12-30 16:08:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:52,271 INFO L225 Difference]: With dead ends: 11015 [2018-12-30 16:08:52,271 INFO L226 Difference]: Without dead ends: 3069 [2018-12-30 16:08:52,280 INFO L631 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 [2018-12-30 16:08:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2018-12-30 16:08:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2018-12-30 16:08:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2018-12-30 16:08:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2018-12-30 16:08:52,342 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2018-12-30 16:08:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:52,343 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2018-12-30 16:08:52,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2018-12-30 16:08:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-12-30 16:08:52,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:52,352 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:52,352 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2018-12-30 16:08:52,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:52,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:52,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:52,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:52,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2018-12-30 16:08:52,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:52,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:52,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:52,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2018-12-30 16:08:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:08:53,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:08:53,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:08:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:08:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:53,403 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 5 states. [2018-12-30 16:08:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:54,511 INFO L93 Difference]: Finished difference Result 3603 states and 4841 transitions. [2018-12-30 16:08:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:08:54,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 510 [2018-12-30 16:08:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:54,513 INFO L225 Difference]: With dead ends: 3603 [2018-12-30 16:08:54,513 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:08:54,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:08:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:08:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:08:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:08:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:08:54,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 510 [2018-12-30 16:08:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:54,519 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:08:54,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:08:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:08:54,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:08:54,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:08:54,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,083 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 103 [2018-12-30 16:08:55,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:56,391 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 48 DAG size of output: 7 [2018-12-30 16:08:56,571 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2018-12-30 16:08:56,686 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-30 16:08:56,929 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2018-12-30 16:08:57,114 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2018-12-30 16:08:57,345 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 16 [2018-12-30 16:08:57,823 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2018-12-30 16:08:57,986 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-30 16:08:57,986 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-12-30 16:08:57,986 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-12-30 16:08:57,986 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-12-30 16:08:57,986 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-12-30 16:08:57,986 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-12-30 16:08:57,986 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:08:57,986 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-12-30 16:08:57,987 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) [2018-12-30 16:08:57,987 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-12-30 16:08:57,988 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:08:57,989 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-12-30 16:08:57,997 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-12-30 16:08:57,997 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-12-30 16:08:57,997 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-12-30 16:08:57,997 INFO L448 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-12-30 16:08:57,997 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-12-30 16:08:57,997 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-12-30 16:08:57,997 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-12-30 16:08:57,998 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-30 16:08:57,999 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-12-30 16:08:58,002 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L451 ceAbstractionStarter]: At program point L550(lines 11 552) the Hoare annotation is: true [2018-12-30 16:08:58,003 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1) .cse2) (and .cse2 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (and .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2018-12-30 16:08:58,003 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-12-30 16:08:58,003 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-12-30 16:08:58,007 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-12-30 16:08:58,007 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:08:58,007 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse5 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (= ULTIMATE.start_ssl3_connect_~s__state~0 4400)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse1 (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3) (and .cse4 .cse0 .cse5) (and .cse0 .cse6 .cse7) (and .cse4 .cse8 .cse7 .cse5) (and .cse9 .cse10 .cse11 .cse7 .cse12) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse8 .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4368) .cse0) (and .cse13 .cse0 .cse7) (and .cse13 .cse8 .cse7 .cse12) (and .cse2 .cse3 .cse11 .cse7 .cse12) (and .cse1 .cse9 .cse10 .cse0) (and .cse6 .cse12))) [2018-12-30 16:08:58,007 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-12-30 16:08:58,007 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-12-30 16:08:58,007 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: false [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-12-30 16:08:58,008 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-12-30 16:08:58,009 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-12-30 16:08:58,012 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2018-12-30 16:08:58,012 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2018-12-30 16:08:58,012 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-12-30 16:08:58,012 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:08:58,012 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-30 16:08:58,012 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-12-30 16:08:58,012 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-12-30 16:08:58,012 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2018-12-30 16:08:58,013 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L451 ceAbstractionStarter]: At program point L561(lines 553 563) the Hoare annotation is: true [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-12-30 16:08:58,013 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-12-30 16:08:58,014 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-12-30 16:08:58,014 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-12-30 16:08:58,014 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-12-30 16:08:58,014 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-12-30 16:08:58,014 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-30 16:08:58,014 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:08:58,014 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-12-30 16:08:58,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:08:58 BoogieIcfgContainer [2018-12-30 16:08:58,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:08:58,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:08:58,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:08:58,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:08:58,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:30" (3/4) ... [2018-12-30 16:08:58,078 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:08:58,099 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:08:58,100 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:08:58,229 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:08:58,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:08:58,231 INFO L168 Benchmark]: Toolchain (without parser) took 29629.29 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 747.6 MB). Free memory was 946.0 MB in the beginning and 1.6 GB in the end (delta: -667.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,231 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:58,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.28 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,232 INFO L168 Benchmark]: Boogie Preprocessor took 50.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,235 INFO L168 Benchmark]: RCFGBuilder took 1313.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,235 INFO L168 Benchmark]: TraceAbstraction took 27463.81 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 612.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -548.4 MB). Peak memory consumption was 741.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,236 INFO L168 Benchmark]: Witness Printer took 159.37 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:58,240 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 502.28 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1313.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27463.81 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 612.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -548.4 MB). Peak memory consumption was 741.0 MB. Max. memory is 11.5 GB. * Witness Printer took 159.37 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 105]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__hit == 0) && 4432 <= s__state) && s__state <= 4560) || (((s__state <= 4560 && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && s__state <= 4448) && 4432 <= s__state) || (((blastFlag <= 4 && s__state <= 4448) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((s__state <= 4464 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) || ((s__state <= 4464 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && s__hit == 0)) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || (s__state == 4384 && blastFlag <= 2)) || (s__state == 4368 && blastFlag <= 2)) || ((s__state == 4400 && blastFlag <= 2) && s__hit == 0)) || (((s__state == 4400 && blastFlag <= 4) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4480 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. SAFE Result, 27.3s OverallTime, 23 OverallIterations, 20 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 4190 SDtfs, 2039 SDslu, 2326 SDs, 0 SdLazy, 2384 SolverSat, 589 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 1288 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 3979 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 178 NumberOfFragments, 481 HoareAnnotationTreeSize, 22 FomulaSimplifications, 19605 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 13737 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6263 ConstructedInterpolants, 0 QuantifiedInterpolants, 3048889 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2137 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 25139/25183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...