./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.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 96aededabe895f84f71d6d614ed1af512bf7353b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:17,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:17,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:17,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:17,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:17,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:17,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:17,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:17,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:17,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:17,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:17,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:17,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:17,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:17,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:17,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:17,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:17,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:17,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:17,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:17,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:17,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:17,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:17,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:17,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:17,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:17,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:17,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:17,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:17,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:17,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:17,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:17,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:17,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:17,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:17,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:17,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:17,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:17,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:17,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:17,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:17,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:34:17,641 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:17,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:17,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:17,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:17,647 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:17,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:17,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:17,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:17,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:17,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:17,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:17,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:17,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:17,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:17,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:17,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:17,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:17,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:17,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:17,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:17,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:17,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:17,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:17,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:17,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:17,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:17,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:17,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:17,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-27 22:34:18,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:18,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:18,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:18,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:18,043 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:18,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-27 22:34:18,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2248ab8e8/c35a8c6dfaf645ad9905cc2934a3cb47/FLAG6bc1b986c [2019-11-27 22:34:18,628 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:18,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-27 22:34:18,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2248ab8e8/c35a8c6dfaf645ad9905cc2934a3cb47/FLAG6bc1b986c [2019-11-27 22:34:18,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2248ab8e8/c35a8c6dfaf645ad9905cc2934a3cb47 [2019-11-27 22:34:18,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:18,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:18,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:18,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:18,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:18,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:18,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b83df50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:18, skipping insertion in model container [2019-11-27 22:34:18,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:18" (1/1) ... [2019-11-27 22:34:18,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:19,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:19,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:19,347 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:19,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:19,498 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:19,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19 WrapperNode [2019-11-27 22:34:19,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:19,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:19,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:19,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:19,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:19,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:19,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:19,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:19,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... [2019-11-27 22:34:19,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:19,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:19,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:19,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:19,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:19,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:19,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:19,835 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:34:20,461 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:34:20,463 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:34:20,468 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:20,468 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:20,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:20 BoogieIcfgContainer [2019-11-27 22:34:20,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:20,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:20,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:20,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:20,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:18" (1/3) ... [2019-11-27 22:34:20,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af17567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:20, skipping insertion in model container [2019-11-27 22:34:20,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:19" (2/3) ... [2019-11-27 22:34:20,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af17567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:20, skipping insertion in model container [2019-11-27 22:34:20,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:20" (3/3) ... [2019-11-27 22:34:20,483 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-27 22:34:20,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:20,503 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:20,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:20,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:20,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:20,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:20,558 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:20,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:20,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:20,559 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:20,559 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-27 22:34:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:34:20,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:20,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:20,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:20,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-27 22:34:20,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:20,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420150844] [2019-11-27 22:34:20,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:20,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420150844] [2019-11-27 22:34:20,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:20,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:20,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297900176] [2019-11-27 22:34:20,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:20,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,933 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-27 22:34:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,329 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-27 22:34:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:34:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,353 INFO L225 Difference]: With dead ends: 322 [2019-11-27 22:34:21,354 INFO L226 Difference]: Without dead ends: 170 [2019-11-27 22:34:21,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-27 22:34:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-27 22:34:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-27 22:34:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-27 22:34:21,463 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-27 22:34:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,464 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-27 22:34:21,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-27 22:34:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:34:21,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:21,473 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-27 22:34:21,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486539219] [2019-11-27 22:34:21,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:21,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486539219] [2019-11-27 22:34:21,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118450598] [2019-11-27 22:34:21,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,627 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-27 22:34:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,867 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-27 22:34:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:34:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,871 INFO L225 Difference]: With dead ends: 371 [2019-11-27 22:34:21,871 INFO L226 Difference]: Without dead ends: 211 [2019-11-27 22:34:21,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-27 22:34:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-27 22:34:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-27 22:34:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-27 22:34:21,891 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-27 22:34:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,892 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-27 22:34:21,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-27 22:34:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-27 22:34:21,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,896 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:21,896 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-27 22:34:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65613298] [2019-11-27 22:34:21,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:21,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65613298] [2019-11-27 22:34:21,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032901395] [2019-11-27 22:34:21,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,998 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-27 22:34:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,229 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-27 22:34:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-27 22:34:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,232 INFO L225 Difference]: With dead ends: 436 [2019-11-27 22:34:22,233 INFO L226 Difference]: Without dead ends: 237 [2019-11-27 22:34:22,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-27 22:34:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-27 22:34:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-27 22:34:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-27 22:34:22,273 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-27 22:34:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,274 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-27 22:34:22,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-27 22:34:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:34:22,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,286 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,286 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-27 22:34:22,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321617600] [2019-11-27 22:34:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:22,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321617600] [2019-11-27 22:34:22,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095915068] [2019-11-27 22:34:22,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,392 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-27 22:34:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,548 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-27 22:34:22,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:34:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,552 INFO L225 Difference]: With dead ends: 484 [2019-11-27 22:34:22,552 INFO L226 Difference]: Without dead ends: 254 [2019-11-27 22:34:22,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-27 22:34:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-27 22:34:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-27 22:34:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-27 22:34:22,585 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-27 22:34:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,586 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-27 22:34:22,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-27 22:34:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:34:22,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,590 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,590 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-27 22:34:22,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379696572] [2019-11-27 22:34:22,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:22,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379696572] [2019-11-27 22:34:22,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162226771] [2019-11-27 22:34:22,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,699 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-27 22:34:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,896 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-27 22:34:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:34:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,900 INFO L225 Difference]: With dead ends: 543 [2019-11-27 22:34:22,900 INFO L226 Difference]: Without dead ends: 298 [2019-11-27 22:34:22,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-27 22:34:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-27 22:34:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-27 22:34:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-27 22:34:22,914 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-27 22:34:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,914 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-27 22:34:22,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-27 22:34:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:22,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,917 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-27 22:34:22,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734595575] [2019-11-27 22:34:22,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:22,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734595575] [2019-11-27 22:34:22,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289906563] [2019-11-27 22:34:22,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,971 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-27 22:34:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,130 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-27 22:34:23,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,133 INFO L225 Difference]: With dead ends: 583 [2019-11-27 22:34:23,134 INFO L226 Difference]: Without dead ends: 296 [2019-11-27 22:34:23,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-27 22:34:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-27 22:34:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-27 22:34:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-27 22:34:23,147 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-27 22:34:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,148 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-27 22:34:23,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-27 22:34:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:23,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,150 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,150 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-27 22:34:23,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879505175] [2019-11-27 22:34:23,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:23,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879505175] [2019-11-27 22:34:23,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135880710] [2019-11-27 22:34:23,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,198 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-27 22:34:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,391 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-27 22:34:23,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,394 INFO L225 Difference]: With dead ends: 585 [2019-11-27 22:34:23,394 INFO L226 Difference]: Without dead ends: 296 [2019-11-27 22:34:23,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-27 22:34:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-27 22:34:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-27 22:34:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-27 22:34:23,408 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-27 22:34:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,408 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-27 22:34:23,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-27 22:34:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-27 22:34:23,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,410 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,410 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-27 22:34:23,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930494340] [2019-11-27 22:34:23,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:34:23,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930494340] [2019-11-27 22:34:23,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428120198] [2019-11-27 22:34:23,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,476 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-27 22:34:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,589 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-27 22:34:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-27 22:34:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,593 INFO L225 Difference]: With dead ends: 585 [2019-11-27 22:34:23,593 INFO L226 Difference]: Without dead ends: 300 [2019-11-27 22:34:23,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-27 22:34:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-27 22:34:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-27 22:34:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-27 22:34:23,608 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-27 22:34:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,608 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-27 22:34:23,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-27 22:34:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-27 22:34:23,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,610 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,610 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-27 22:34:23,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839916099] [2019-11-27 22:34:23,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:23,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839916099] [2019-11-27 22:34:23,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662230370] [2019-11-27 22:34:23,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,682 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-27 22:34:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,846 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-27 22:34:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-27 22:34:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,849 INFO L225 Difference]: With dead ends: 624 [2019-11-27 22:34:23,850 INFO L226 Difference]: Without dead ends: 331 [2019-11-27 22:34:23,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-27 22:34:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-27 22:34:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-27 22:34:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-27 22:34:23,865 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-27 22:34:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,866 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-27 22:34:23,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-27 22:34:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:34:23,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,869 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,870 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-27 22:34:23,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129981958] [2019-11-27 22:34:23,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:23,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129981958] [2019-11-27 22:34:23,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310665728] [2019-11-27 22:34:23,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,936 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-27 22:34:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,094 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-27 22:34:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:34:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,097 INFO L225 Difference]: With dead ends: 685 [2019-11-27 22:34:24,098 INFO L226 Difference]: Without dead ends: 363 [2019-11-27 22:34:24,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-27 22:34:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-27 22:34:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:34:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-27 22:34:24,116 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-27 22:34:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,117 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-27 22:34:24,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-27 22:34:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:34:24,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,119 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:24,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-27 22:34:24,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667160152] [2019-11-27 22:34:24,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:24,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667160152] [2019-11-27 22:34:24,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:24,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701030521] [2019-11-27 22:34:24,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,163 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-27 22:34:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,304 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-27 22:34:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:34:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,307 INFO L225 Difference]: With dead ends: 707 [2019-11-27 22:34:24,307 INFO L226 Difference]: Without dead ends: 358 [2019-11-27 22:34:24,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-27 22:34:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-27 22:34:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:34:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-27 22:34:24,320 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-27 22:34:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,321 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-27 22:34:24,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-27 22:34:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:34:24,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,323 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:24,323 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-27 22:34:24,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20260853] [2019-11-27 22:34:24,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:34:24,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20260853] [2019-11-27 22:34:24,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:24,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456824201] [2019-11-27 22:34:24,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,361 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-27 22:34:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,542 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-27 22:34:24,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:34:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,547 INFO L225 Difference]: With dead ends: 712 [2019-11-27 22:34:24,547 INFO L226 Difference]: Without dead ends: 363 [2019-11-27 22:34:24,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-27 22:34:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-27 22:34:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:34:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-27 22:34:24,574 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-27 22:34:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,574 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-27 22:34:24,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-27 22:34:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:34:24,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,578 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:24,579 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-27 22:34:24,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582786608] [2019-11-27 22:34:24,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:24,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582786608] [2019-11-27 22:34:24,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:24,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875184329] [2019-11-27 22:34:24,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,637 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-27 22:34:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,834 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-27 22:34:24,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:34:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,839 INFO L225 Difference]: With dead ends: 730 [2019-11-27 22:34:24,839 INFO L226 Difference]: Without dead ends: 381 [2019-11-27 22:34:24,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-27 22:34:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-27 22:34:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-27 22:34:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-27 22:34:24,867 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-27 22:34:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,868 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-27 22:34:24,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-27 22:34:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:34:24,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,872 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:24,872 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-27 22:34:24,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939926427] [2019-11-27 22:34:24,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:24,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939926427] [2019-11-27 22:34:24,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:24,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066037744] [2019-11-27 22:34:24,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,963 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-27 22:34:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,146 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-27 22:34:25,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:34:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,150 INFO L225 Difference]: With dead ends: 751 [2019-11-27 22:34:25,150 INFO L226 Difference]: Without dead ends: 381 [2019-11-27 22:34:25,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-27 22:34:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-27 22:34:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-27 22:34:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-27 22:34:25,171 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-27 22:34:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:25,172 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-27 22:34:25,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-27 22:34:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 22:34:25,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:25,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:25,175 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-27 22:34:25,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262630488] [2019-11-27 22:34:25,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:34:25,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262630488] [2019-11-27 22:34:25,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:25,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179330272] [2019-11-27 22:34:25,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:25,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,229 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-27 22:34:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,271 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-27 22:34:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:25,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 22:34:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,277 INFO L225 Difference]: With dead ends: 747 [2019-11-27 22:34:25,277 INFO L226 Difference]: Without dead ends: 745 [2019-11-27 22:34:25,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-27 22:34:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-27 22:34:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-27 22:34:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-27 22:34:25,308 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-27 22:34:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:25,308 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-27 22:34:25,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-27 22:34:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:34:25,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:25,311 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:25,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-27 22:34:25,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199264684] [2019-11-27 22:34:25,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,323 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:25,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723836860] [2019-11-27 22:34:25,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:25,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:25,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199264684] [2019-11-27 22:34:25,466 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:25,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723836860] [2019-11-27 22:34:25,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:25,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016467902] [2019-11-27 22:34:25,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:25,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:25,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,470 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-27 22:34:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,546 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-27 22:34:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:25,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:34:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,553 INFO L225 Difference]: With dead ends: 1851 [2019-11-27 22:34:25,553 INFO L226 Difference]: Without dead ends: 1113 [2019-11-27 22:34:25,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-27 22:34:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-27 22:34:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-27 22:34:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-27 22:34:25,606 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-27 22:34:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:25,606 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-27 22:34:25,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-27 22:34:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-27 22:34:25,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:25,609 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:34:25,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:25,813 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-27 22:34:25,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134898546] [2019-11-27 22:34:25,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,827 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:25,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512620419] [2019-11-27 22:34:25,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:25,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:25,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134898546] [2019-11-27 22:34:25,976 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:25,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512620419] [2019-11-27 22:34:25,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:25,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236210099] [2019-11-27 22:34:25,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:25,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:25,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,978 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-27 22:34:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,048 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-27 22:34:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:26,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-27 22:34:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,056 INFO L225 Difference]: With dead ends: 2219 [2019-11-27 22:34:26,057 INFO L226 Difference]: Without dead ends: 1481 [2019-11-27 22:34:26,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-27 22:34:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-27 22:34:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-27 22:34:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-27 22:34:26,117 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-27 22:34:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,118 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-27 22:34:26,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-27 22:34:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-27 22:34:26,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,124 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:26,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:26,330 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-27 22:34:26,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548576914] [2019-11-27 22:34:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-27 22:34:26,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548576914] [2019-11-27 22:34:26,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:26,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:26,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007795116] [2019-11-27 22:34:26,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:26,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,428 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-27 22:34:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,682 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-27 22:34:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:26,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-27 22:34:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,695 INFO L225 Difference]: With dead ends: 3059 [2019-11-27 22:34:26,696 INFO L226 Difference]: Without dead ends: 1585 [2019-11-27 22:34:26,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-27 22:34:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-27 22:34:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-27 22:34:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-27 22:34:26,783 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-27 22:34:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,784 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-27 22:34:26,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-27 22:34:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-27 22:34:26,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,792 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:26,792 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-27 22:34:26,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799696612] [2019-11-27 22:34:26,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,811 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:26,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339341935] [2019-11-27 22:34:26,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:26,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:26,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:34:26,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799696612] [2019-11-27 22:34:26,978 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:26,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339341935] [2019-11-27 22:34:26,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:26,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:26,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068163316] [2019-11-27 22:34:26,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:26,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,983 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-27 22:34:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:27,086 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-27 22:34:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:27,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-27 22:34:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:27,101 INFO L225 Difference]: With dead ends: 3139 [2019-11-27 22:34:27,101 INFO L226 Difference]: Without dead ends: 1964 [2019-11-27 22:34:27,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-27 22:34:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-27 22:34:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-27 22:34:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-27 22:34:27,200 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-27 22:34:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:27,200 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-27 22:34:27,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-27 22:34:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-27 22:34:27,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:27,209 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:27,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:27,414 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-27 22:34:27,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:27,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474466964] [2019-11-27 22:34:27,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:27,432 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:27,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66647013] [2019-11-27 22:34:27,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:27,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:27,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-27 22:34:27,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474466964] [2019-11-27 22:34:27,605 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:27,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66647013] [2019-11-27 22:34:27,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:27,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:27,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656120224] [2019-11-27 22:34:27,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:27,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:27,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:27,612 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-27 22:34:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:27,729 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-27 22:34:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:27,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-27 22:34:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:27,750 INFO L225 Difference]: With dead ends: 5743 [2019-11-27 22:34:27,751 INFO L226 Difference]: Without dead ends: 3786 [2019-11-27 22:34:27,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-27 22:34:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-27 22:34:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-27 22:34:27,890 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-27 22:34:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:27,891 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-27 22:34:27,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-27 22:34:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-27 22:34:27,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:27,901 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:28,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:28,106 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-27 22:34:28,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:28,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385920616] [2019-11-27 22:34:28,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:28,118 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:28,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666533282] [2019-11-27 22:34:28,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:28,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:28,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-27 22:34:28,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385920616] [2019-11-27 22:34:28,253 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:28,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666533282] [2019-11-27 22:34:28,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:28,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:28,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633251563] [2019-11-27 22:34:28,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:28,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:28,255 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-27 22:34:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:28,496 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-27 22:34:28,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:28,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-27 22:34:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:28,515 INFO L225 Difference]: With dead ends: 7651 [2019-11-27 22:34:28,515 INFO L226 Difference]: Without dead ends: 3874 [2019-11-27 22:34:28,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-27 22:34:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-27 22:34:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-27 22:34:28,659 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-27 22:34:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:28,660 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-27 22:34:28,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-27 22:34:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-27 22:34:28,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:28,670 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:28,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:28,875 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-27 22:34:28,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:28,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964155250] [2019-11-27 22:34:28,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-27 22:34:28,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964155250] [2019-11-27 22:34:28,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:28,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:28,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427357955] [2019-11-27 22:34:28,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:28,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:28,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:28,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:28,963 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-27 22:34:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:29,258 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-27 22:34:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:29,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-27 22:34:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:29,279 INFO L225 Difference]: With dead ends: 7683 [2019-11-27 22:34:29,279 INFO L226 Difference]: Without dead ends: 3906 [2019-11-27 22:34:29,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-27 22:34:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-27 22:34:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-27 22:34:29,410 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-27 22:34:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:29,411 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-27 22:34:29,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-27 22:34:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-27 22:34:29,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:29,422 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:29,422 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:29,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-27 22:34:29,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:29,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503735083] [2019-11-27 22:34:29,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:29,437 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:29,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572648765] [2019-11-27 22:34:29,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:29,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:29,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-27 22:34:29,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503735083] [2019-11-27 22:34:29,594 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:29,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572648765] [2019-11-27 22:34:29,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:29,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:29,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684758132] [2019-11-27 22:34:29,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:29,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:29,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:29,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,597 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-27 22:34:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:29,822 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-27 22:34:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:29,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-27 22:34:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:29,852 INFO L225 Difference]: With dead ends: 7561 [2019-11-27 22:34:29,854 INFO L226 Difference]: Without dead ends: 3784 [2019-11-27 22:34:29,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-27 22:34:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-27 22:34:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-27 22:34:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-27 22:34:29,987 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-27 22:34:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:29,988 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-27 22:34:29,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-27 22:34:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-27 22:34:30,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:30,001 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:30,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:30,210 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-27 22:34:30,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:30,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926141157] [2019-11-27 22:34:30,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:30,226 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 22:34:30,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578537066] [2019-11-27 22:34:30,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:30,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:30,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-27 22:34:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926141157] [2019-11-27 22:34:30,404 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 22:34:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578537066] [2019-11-27 22:34:30,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:30,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:30,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477242289] [2019-11-27 22:34:30,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:30,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:30,406 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-27 22:34:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:30,669 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-27 22:34:30,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:30,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-27 22:34:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:30,676 INFO L225 Difference]: With dead ends: 7951 [2019-11-27 22:34:30,676 INFO L226 Difference]: Without dead ends: 2307 [2019-11-27 22:34:30,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-27 22:34:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-27 22:34:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-27 22:34:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-27 22:34:30,802 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-27 22:34:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:30,802 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-27 22:34:30,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-27 22:34:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-27 22:34:30,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:30,812 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:31,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:31,025 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-27 22:34:31,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:31,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305396656] [2019-11-27 22:34:31,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-27 22:34:31,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305396656] [2019-11-27 22:34:31,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:31,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:31,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082955020] [2019-11-27 22:34:31,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:31,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:31,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,129 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-27 22:34:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:31,313 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-27 22:34:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:31,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-27 22:34:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:31,320 INFO L225 Difference]: With dead ends: 4829 [2019-11-27 22:34:31,320 INFO L226 Difference]: Without dead ends: 2529 [2019-11-27 22:34:31,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-27 22:34:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-27 22:34:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-27 22:34:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-27 22:34:31,384 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-27 22:34:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:31,384 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-27 22:34:31,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-27 22:34:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-27 22:34:31,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:31,394 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:31,396 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-27 22:34:31,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:31,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567252591] [2019-11-27 22:34:31,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-27 22:34:31,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567252591] [2019-11-27 22:34:31,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:31,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:31,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341047419] [2019-11-27 22:34:31,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:31,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:31,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,527 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-27 22:34:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:31,701 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-27 22:34:31,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:31,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-27 22:34:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:31,707 INFO L225 Difference]: With dead ends: 4949 [2019-11-27 22:34:31,708 INFO L226 Difference]: Without dead ends: 2499 [2019-11-27 22:34:31,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-27 22:34:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-27 22:34:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-27 22:34:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-27 22:34:31,777 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-27 22:34:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:31,778 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-27 22:34:31,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-27 22:34:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-27 22:34:31,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:31,788 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:31,789 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-27 22:34:31,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:31,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966832016] [2019-11-27 22:34:31,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:34:31,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966832016] [2019-11-27 22:34:31,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19862461] [2019-11-27 22:34:31,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:32,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:32,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:34:32,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:32,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:32,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555600074] [2019-11-27 22:34:32,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:32,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:32,231 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-27 22:34:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:32,680 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-11-27 22:34:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:34:32,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-27 22:34:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:32,690 INFO L225 Difference]: With dead ends: 7213 [2019-11-27 22:34:32,690 INFO L226 Difference]: Without dead ends: 4617 [2019-11-27 22:34:32,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-11-27 22:34:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-11-27 22:34:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-27 22:34:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-27 22:34:32,774 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-27 22:34:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:32,775 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-27 22:34:32,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-27 22:34:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-27 22:34:32,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:32,782 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-27 22:34:32,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:32,986 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-27 22:34:32,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:32,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064319867] [2019-11-27 22:34:32,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-27 22:34:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064319867] [2019-11-27 22:34:33,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:33,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:33,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657975737] [2019-11-27 22:34:33,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:33,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,147 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-27 22:34:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:33,385 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-27 22:34:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:33,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-27 22:34:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:33,392 INFO L225 Difference]: With dead ends: 5073 [2019-11-27 22:34:33,393 INFO L226 Difference]: Without dead ends: 2546 [2019-11-27 22:34:33,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-27 22:34:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-27 22:34:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-27 22:34:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-27 22:34:33,487 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-27 22:34:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:33,487 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-27 22:34:33,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-27 22:34:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-27 22:34:33,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:33,496 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:33,496 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-27 22:34:33,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:33,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754557354] [2019-11-27 22:34:33,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-27 22:34:33,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754557354] [2019-11-27 22:34:33,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:33,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:33,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620441743] [2019-11-27 22:34:33,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:33,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,770 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-27 22:34:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:33,951 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-27 22:34:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:33,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-27 22:34:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:33,957 INFO L225 Difference]: With dead ends: 5277 [2019-11-27 22:34:33,957 INFO L226 Difference]: Without dead ends: 2750 [2019-11-27 22:34:33,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-27 22:34:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-27 22:34:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-27 22:34:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-27 22:34:34,022 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-27 22:34:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:34,023 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-27 22:34:34,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-27 22:34:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-27 22:34:34,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:34,031 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:34,031 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-27 22:34:34,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:34,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676153467] [2019-11-27 22:34:34,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-27 22:34:34,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676153467] [2019-11-27 22:34:34,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:34,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:34,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976446367] [2019-11-27 22:34:34,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:34,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:34,243 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-27 22:34:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:34,415 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-27 22:34:34,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:34,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-27 22:34:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:34,421 INFO L225 Difference]: With dead ends: 5697 [2019-11-27 22:34:34,422 INFO L226 Difference]: Without dead ends: 2966 [2019-11-27 22:34:34,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-27 22:34:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-27 22:34:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-27 22:34:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-27 22:34:34,494 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-27 22:34:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:34,494 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-27 22:34:34,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-27 22:34:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-27 22:34:34,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:34,504 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:34,504 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-27 22:34:34,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:34,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843910843] [2019-11-27 22:34:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:34:34,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843910843] [2019-11-27 22:34:34,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577565743] [2019-11-27 22:34:34,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:34,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:34,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:34:35,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:35,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:35,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383562419] [2019-11-27 22:34:35,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:35,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:35,190 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-27 22:34:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:35,414 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-27 22:34:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:35,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-27 22:34:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:35,416 INFO L225 Difference]: With dead ends: 4704 [2019-11-27 22:34:35,416 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:34:35,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:34:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:34:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:34:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:34:35,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-27 22:34:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:35,422 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:34:35,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:34:35,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:34:35,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:35,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:34:36,001 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-27 22:34:36,425 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-27 22:34:36,673 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-27 22:34:36,815 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-27 22:34:37,068 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-27 22:34:37,318 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-27 22:34:37,482 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-27 22:34:37,676 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-27 22:34:37,853 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-27 22:34:38,045 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-27 22:34:38,260 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-27 22:34:38,444 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-27 22:34:38,633 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-27 22:34:38,800 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-27 22:34:39,016 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-27 22:34:39,158 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-27 22:34:39,396 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-27 22:34:39,578 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-27 22:34:39,872 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-27 22:34:40,017 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-27 22:34:40,179 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-27 22:34:40,186 INFO L246 CegarLoopResult]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-27 22:34:40,186 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-27 22:34:40,186 INFO L246 CegarLoopResult]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-27 22:34:40,186 INFO L246 CegarLoopResult]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-27 22:34:40,186 INFO L246 CegarLoopResult]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-27 22:34:40,187 INFO L246 CegarLoopResult]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-27 22:34:40,187 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-27 22:34:40,187 INFO L242 CegarLoopResult]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-27 22:34:40,187 INFO L242 CegarLoopResult]: At program point L103(lines 102 625) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-27 22:34:40,187 INFO L246 CegarLoopResult]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-27 22:34:40,187 INFO L246 CegarLoopResult]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,188 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-27 22:34:40,188 INFO L246 CegarLoopResult]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-27 22:34:40,188 INFO L246 CegarLoopResult]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-27 22:34:40,188 INFO L246 CegarLoopResult]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-27 22:34:40,188 INFO L246 CegarLoopResult]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-27 22:34:40,188 INFO L242 CegarLoopResult]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:34:40,188 INFO L242 CegarLoopResult]: At program point L172(lines 168 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,189 INFO L242 CegarLoopResult]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-11-27 22:34:40,190 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-27 22:34:40,190 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-27 22:34:40,190 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-27 22:34:40,190 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,190 INFO L246 CegarLoopResult]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-27 22:34:40,191 INFO L246 CegarLoopResult]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-27 22:34:40,191 INFO L246 CegarLoopResult]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-27 22:34:40,191 INFO L246 CegarLoopResult]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-27 22:34:40,191 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-27 22:34:40,191 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-27 22:34:40,192 INFO L242 CegarLoopResult]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:34:40,192 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-27 22:34:40,192 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-27 22:34:40,192 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-27 22:34:40,192 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-27 22:34:40,193 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,193 INFO L249 CegarLoopResult]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-27 22:34:40,193 INFO L246 CegarLoopResult]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-27 22:34:40,193 INFO L246 CegarLoopResult]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-27 22:34:40,193 INFO L246 CegarLoopResult]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-27 22:34:40,193 INFO L246 CegarLoopResult]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-27 22:34:40,194 INFO L246 CegarLoopResult]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-27 22:34:40,194 INFO L249 CegarLoopResult]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-27 22:34:40,194 INFO L246 CegarLoopResult]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-27 22:34:40,194 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-27 22:34:40,194 INFO L242 CegarLoopResult]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,195 INFO L242 CegarLoopResult]: At program point L145(lines 141 612) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,195 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-27 22:34:40,195 INFO L242 CegarLoopResult]: At program point L212(lines 105 624) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,195 INFO L246 CegarLoopResult]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-27 22:34:40,196 INFO L246 CegarLoopResult]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-27 22:34:40,196 INFO L246 CegarLoopResult]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-27 22:34:40,196 INFO L246 CegarLoopResult]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-27 22:34:40,196 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-27 22:34:40,196 INFO L246 CegarLoopResult]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-27 22:34:40,196 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-27 22:34:40,197 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-27 22:34:40,197 INFO L246 CegarLoopResult]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-27 22:34:40,197 INFO L246 CegarLoopResult]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-27 22:34:40,197 INFO L246 CegarLoopResult]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-27 22:34:40,197 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-27 22:34:40,197 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-27 22:34:40,198 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-27 22:34:40,198 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-27 22:34:40,198 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-27 22:34:40,198 INFO L242 CegarLoopResult]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,199 INFO L242 CegarLoopResult]: At program point L151(lines 147 610) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,199 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,199 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,199 INFO L246 CegarLoopResult]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-27 22:34:40,199 INFO L246 CegarLoopResult]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-27 22:34:40,199 INFO L246 CegarLoopResult]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-27 22:34:40,200 INFO L246 CegarLoopResult]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-27 22:34:40,200 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-27 22:34:40,200 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-27 22:34:40,200 INFO L242 CegarLoopResult]: At program point L121(lines 117 620) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-11-27 22:34:40,200 INFO L242 CegarLoopResult]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-11-27 22:34:40,201 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-27 22:34:40,201 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-27 22:34:40,201 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-27 22:34:40,201 INFO L246 CegarLoopResult]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-27 22:34:40,201 INFO L246 CegarLoopResult]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-27 22:34:40,202 INFO L246 CegarLoopResult]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-27 22:34:40,202 INFO L249 CegarLoopResult]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-27 22:34:40,202 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-27 22:34:40,202 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-27 22:34:40,202 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,202 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,203 INFO L242 CegarLoopResult]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-27 22:34:40,203 INFO L242 CegarLoopResult]: At program point L157(lines 153 608) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-27 22:34:40,203 INFO L242 CegarLoopResult]: At program point L124(lines 123 618) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-27 22:34:40,204 INFO L246 CegarLoopResult]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-27 22:34:40,204 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-27 22:34:40,204 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-27 22:34:40,204 INFO L242 CegarLoopResult]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,204 INFO L246 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-27 22:34:40,205 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-27 22:34:40,205 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-27 22:34:40,205 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-27 22:34:40,205 INFO L246 CegarLoopResult]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-27 22:34:40,205 INFO L246 CegarLoopResult]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-27 22:34:40,206 INFO L246 CegarLoopResult]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-27 22:34:40,206 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-27 22:34:40,206 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-27 22:34:40,206 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,206 INFO L249 CegarLoopResult]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-27 22:34:40,206 INFO L246 CegarLoopResult]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-27 22:34:40,207 INFO L246 CegarLoopResult]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-27 22:34:40,207 INFO L246 CegarLoopResult]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-27 22:34:40,207 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-27 22:34:40,207 INFO L242 CegarLoopResult]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,207 INFO L242 CegarLoopResult]: At program point L163(lines 159 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,208 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,208 INFO L246 CegarLoopResult]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-27 22:34:40,208 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-27 22:34:40,208 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-11-27 22:34:40,208 INFO L246 CegarLoopResult]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-27 22:34:40,208 INFO L246 CegarLoopResult]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-27 22:34:40,209 INFO L246 CegarLoopResult]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-27 22:34:40,209 INFO L246 CegarLoopResult]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-27 22:34:40,209 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-27 22:34:40,209 INFO L246 CegarLoopResult]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-27 22:34:40,209 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-27 22:34:40,210 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,210 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-27 22:34:40,210 INFO L246 CegarLoopResult]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-27 22:34:40,210 INFO L246 CegarLoopResult]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-27 22:34:40,210 INFO L246 CegarLoopResult]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-27 22:34:40,210 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,211 INFO L246 CegarLoopResult]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-27 22:34:40,211 INFO L246 CegarLoopResult]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-27 22:34:40,211 INFO L246 CegarLoopResult]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-27 22:34:40,211 INFO L246 CegarLoopResult]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-27 22:34:40,211 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-27 22:34:40,212 INFO L242 CegarLoopResult]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,212 INFO L242 CegarLoopResult]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-27 22:34:40,212 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 22:34:40,212 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-27 22:34:40,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:40 BoogieIcfgContainer [2019-11-27 22:34:40,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:40,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:40,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:40,255 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:40,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:20" (3/4) ... [2019-11-27 22:34:40,264 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:34:40,288 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:34:40,289 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:34:40,398 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:40,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:40,400 INFO L168 Benchmark]: Toolchain (without parser) took 21443.24 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 847.2 MB). Free memory was 960.4 MB in the beginning and 951.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 856.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,400 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:40,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:40,402 INFO L168 Benchmark]: Boogie Preprocessor took 47.53 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. [2019-11-27 22:34:40,402 INFO L168 Benchmark]: RCFGBuilder took 846.70 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: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,402 INFO L168 Benchmark]: TraceAbstraction took 19781.07 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 703.1 MB). Free memory was 1.1 GB in the beginning and 971.5 MB in the end (delta: 103.3 MB). Peak memory consumption was 960.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,403 INFO L168 Benchmark]: Witness Printer took 144.51 ms. Allocated memory is still 1.9 GB. Free memory was 971.5 MB in the beginning and 951.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,405 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 540.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.53 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 846.70 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: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19781.07 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 703.1 MB). Free memory was 1.1 GB in the beginning and 971.5 MB in the end (delta: 103.3 MB). Peak memory consumption was 960.0 MB. Max. memory is 11.5 GB. * Witness Printer took 144.51 ms. Allocated memory is still 1.9 GB. Free memory was 971.5 MB in the beginning and 951.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 15.0s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...