./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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.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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:51:24,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:51:24,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:51:24,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:51:24,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:51:24,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:51:24,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:51:24,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:51:24,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:51:24,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:51:24,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:51:24,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:51:24,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:51:24,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:51:24,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:51:24,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:51:24,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:51:24,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:51:24,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:51:24,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:51:24,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:51:24,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:51:24,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:51:24,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:51:24,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:51:24,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:51:24,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:51:24,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:51:24,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:51:24,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:51:24,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:51:24,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:51:24,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:51:24,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:51:24,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:51:24,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:51:24,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:51:24,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:51:24,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:51:24,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:51:24,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:51:24,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:51:24,777 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:51:24,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:51:24,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:51:24,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:51:24,779 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:51:24,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:51:24,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:51:24,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:51:24,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:51:24,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:51:24,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:51:24,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:51:24,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:51:24,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:51:24,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:51:24,783 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:51:24,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:51:24,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:51:24,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:51:24,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:51:24,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:51:24,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:51:24,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:51:24,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:51:24,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:51:24,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:51:24,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:51:24,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:51:24,786 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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-19 20:51:25,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:51:25,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:51:25,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:51:25,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:51:25,142 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:51:25,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-19 20:51:25,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1159d23d1/754fc81010b542569750de1533e863ed/FLAGb582f7185 [2019-11-19 20:51:25,749 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:51:25,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-19 20:51:25,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1159d23d1/754fc81010b542569750de1533e863ed/FLAGb582f7185 [2019-11-19 20:51:26,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1159d23d1/754fc81010b542569750de1533e863ed [2019-11-19 20:51:26,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:51:26,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:51:26,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:51:26,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:51:26,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:51:26,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14346a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26, skipping insertion in model container [2019-11-19 20:51:26,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,115 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:51:26,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:51:26,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:51:26,522 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:51:26,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:51:26,632 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:51:26,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26 WrapperNode [2019-11-19 20:51:26,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:51:26,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:51:26,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:51:26,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:51:26,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:51:26,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:51:26,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:51:26,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:51:26,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (1/1) ... [2019-11-19 20:51:26,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:51:26,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:51:26,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:51:26,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:51:26,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (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-19 20:51:26,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:51:26,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:51:26,970 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 20:51:27,636 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 20:51:27,637 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 20:51:27,638 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:51:27,639 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:51:27,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:27 BoogieIcfgContainer [2019-11-19 20:51:27,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:51:27,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:51:27,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:51:27,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:51:27,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:26" (1/3) ... [2019-11-19 20:51:27,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff25237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:27, skipping insertion in model container [2019-11-19 20:51:27,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:26" (2/3) ... [2019-11-19 20:51:27,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff25237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:27, skipping insertion in model container [2019-11-19 20:51:27,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:27" (3/3) ... [2019-11-19 20:51:27,650 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-19 20:51:27,661 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:51:27,669 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:51:27,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:51:27,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:51:27,710 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:51:27,710 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:51:27,711 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:51:27,711 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:51:27,711 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:51:27,711 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:51:27,711 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:51:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-19 20:51:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 20:51:27,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:27,743 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-19 20:51:27,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:27,749 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-19 20:51:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:27,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172633859] [2019-11-19 20:51:27,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:27,977 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-19 20:51:27,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172633859] [2019-11-19 20:51:27,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:27,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:27,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285259517] [2019-11-19 20:51:27,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:27,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:28,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:28,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:28,006 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-19 20:51:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:28,399 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-19 20:51:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:28,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 20:51:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:28,430 INFO L225 Difference]: With dead ends: 322 [2019-11-19 20:51:28,431 INFO L226 Difference]: Without dead ends: 170 [2019-11-19 20:51:28,438 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-19 20:51:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-19 20:51:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-19 20:51:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 20:51:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-19 20:51:28,533 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-19 20:51:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:28,534 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-19 20:51:28,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-19 20:51:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 20:51:28,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:28,538 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-19 20:51:28,538 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-19 20:51:28,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:28,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83463587] [2019-11-19 20:51:28,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:28,639 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-19 20:51:28,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83463587] [2019-11-19 20:51:28,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:28,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:28,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928282923] [2019-11-19 20:51:28,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:28,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:28,647 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-19 20:51:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:28,899 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-19 20:51:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:28,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-19 20:51:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:28,902 INFO L225 Difference]: With dead ends: 371 [2019-11-19 20:51:28,902 INFO L226 Difference]: Without dead ends: 211 [2019-11-19 20:51:28,904 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-19 20:51:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-19 20:51:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-19 20:51:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-19 20:51:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-19 20:51:28,925 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-19 20:51:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:28,926 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-19 20:51:28,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-19 20:51:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-19 20:51:28,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:28,932 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-19 20:51:28,933 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-19 20:51:28,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:28,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21421494] [2019-11-19 20:51:28,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:29,040 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-19 20:51:29,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21421494] [2019-11-19 20:51:29,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:29,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:29,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961274679] [2019-11-19 20:51:29,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:29,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:29,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:29,043 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-19 20:51:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:29,215 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-19 20:51:29,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:29,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-19 20:51:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:29,218 INFO L225 Difference]: With dead ends: 436 [2019-11-19 20:51:29,219 INFO L226 Difference]: Without dead ends: 237 [2019-11-19 20:51:29,220 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-19 20:51:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-19 20:51:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-19 20:51:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-19 20:51:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-19 20:51:29,247 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-19 20:51:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:29,247 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-19 20:51:29,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-19 20:51:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 20:51:29,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:29,250 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-19 20:51:29,251 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:29,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-19 20:51:29,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:29,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642771399] [2019-11-19 20:51:29,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:29,331 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-19 20:51:29,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642771399] [2019-11-19 20:51:29,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:29,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:29,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955904645] [2019-11-19 20:51:29,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:29,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:29,335 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-19 20:51:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:29,496 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-19 20:51:29,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:29,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 20:51:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:29,500 INFO L225 Difference]: With dead ends: 484 [2019-11-19 20:51:29,501 INFO L226 Difference]: Without dead ends: 254 [2019-11-19 20:51:29,502 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-19 20:51:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-19 20:51:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-19 20:51:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 20:51:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-19 20:51:29,526 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-19 20:51:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:29,527 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-19 20:51:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-19 20:51:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 20:51:29,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:29,529 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-19 20:51:29,530 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-19 20:51:29,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:29,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582588679] [2019-11-19 20:51:29,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:29,609 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-19 20:51:29,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582588679] [2019-11-19 20:51:29,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:29,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:29,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965946260] [2019-11-19 20:51:29,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:29,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:29,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:29,613 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-19 20:51:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:29,817 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-19 20:51:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:29,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 20:51:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:29,823 INFO L225 Difference]: With dead ends: 543 [2019-11-19 20:51:29,823 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 20:51:29,824 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-19 20:51:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 20:51:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-19 20:51:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-19 20:51:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-19 20:51:29,844 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-19 20:51:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:29,845 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-19 20:51:29,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-19 20:51:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 20:51:29,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:29,848 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-19 20:51:29,848 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:29,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-19 20:51:29,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:29,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596773862] [2019-11-19 20:51:29,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:29,903 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-19 20:51:29,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596773862] [2019-11-19 20:51:29,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:29,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:29,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855963967] [2019-11-19 20:51:29,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:29,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:29,907 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-19 20:51:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:30,065 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-19 20:51:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:30,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 20:51:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:30,068 INFO L225 Difference]: With dead ends: 583 [2019-11-19 20:51:30,068 INFO L226 Difference]: Without dead ends: 296 [2019-11-19 20:51:30,069 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-19 20:51:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-19 20:51:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-19 20:51:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-19 20:51:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-19 20:51:30,081 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-19 20:51:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:30,081 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-19 20:51:30,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-19 20:51:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 20:51:30,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:30,088 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-19 20:51:30,088 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-19 20:51:30,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:30,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154895281] [2019-11-19 20:51:30,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:30,178 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-19 20:51:30,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154895281] [2019-11-19 20:51:30,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:30,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:30,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907275553] [2019-11-19 20:51:30,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:30,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:30,181 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-19 20:51:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:30,358 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-19 20:51:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:30,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 20:51:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:30,361 INFO L225 Difference]: With dead ends: 585 [2019-11-19 20:51:30,361 INFO L226 Difference]: Without dead ends: 296 [2019-11-19 20:51:30,362 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-19 20:51:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-19 20:51:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-19 20:51:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-19 20:51:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-19 20:51:30,374 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-19 20:51:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:30,374 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-19 20:51:30,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-19 20:51:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 20:51:30,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:30,376 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-19 20:51:30,376 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-19 20:51:30,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:30,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082971035] [2019-11-19 20:51:30,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:30,419 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-19 20:51:30,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082971035] [2019-11-19 20:51:30,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:30,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:30,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647156344] [2019-11-19 20:51:30,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:30,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:30,422 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-19 20:51:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:30,540 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-19 20:51:30,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:30,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-19 20:51:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:30,543 INFO L225 Difference]: With dead ends: 585 [2019-11-19 20:51:30,543 INFO L226 Difference]: Without dead ends: 300 [2019-11-19 20:51:30,544 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-19 20:51:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-19 20:51:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-19 20:51:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-19 20:51:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-19 20:51:30,559 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-19 20:51:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:30,560 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-19 20:51:30,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-19 20:51:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 20:51:30,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:30,561 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-19 20:51:30,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-19 20:51:30,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:30,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518677511] [2019-11-19 20:51:30,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:30,655 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-19 20:51:30,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518677511] [2019-11-19 20:51:30,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:30,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:30,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139402657] [2019-11-19 20:51:30,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:30,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:30,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:30,657 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-19 20:51:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:30,811 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-19 20:51:30,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:30,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-19 20:51:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:30,813 INFO L225 Difference]: With dead ends: 624 [2019-11-19 20:51:30,814 INFO L226 Difference]: Without dead ends: 331 [2019-11-19 20:51:30,814 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-19 20:51:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-19 20:51:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-19 20:51:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-19 20:51:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-19 20:51:30,827 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-19 20:51:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:30,827 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-19 20:51:30,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-19 20:51:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:51:30,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:30,829 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-19 20:51:30,829 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-19 20:51:30,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:30,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547028909] [2019-11-19 20:51:30,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:30,871 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-19 20:51:30,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547028909] [2019-11-19 20:51:30,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:30,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:30,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010529731] [2019-11-19 20:51:30,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:30,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:30,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:30,878 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-19 20:51:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:31,165 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-19 20:51:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:31,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-19 20:51:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:31,170 INFO L225 Difference]: With dead ends: 685 [2019-11-19 20:51:31,170 INFO L226 Difference]: Without dead ends: 363 [2019-11-19 20:51:31,171 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-19 20:51:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-19 20:51:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-19 20:51:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-19 20:51:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-19 20:51:31,189 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-19 20:51:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:31,191 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-19 20:51:31,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-19 20:51:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 20:51:31,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:31,195 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-19 20:51:31,196 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:31,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-19 20:51:31,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:31,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357150713] [2019-11-19 20:51:31,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:31,246 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-19 20:51:31,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357150713] [2019-11-19 20:51:31,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:31,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:31,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097304921] [2019-11-19 20:51:31,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:31,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:31,249 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-19 20:51:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:31,413 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-19 20:51:31,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:31,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-19 20:51:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:31,416 INFO L225 Difference]: With dead ends: 707 [2019-11-19 20:51:31,416 INFO L226 Difference]: Without dead ends: 358 [2019-11-19 20:51:31,418 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-19 20:51:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-19 20:51:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-19 20:51:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-19 20:51:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-19 20:51:31,432 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-19 20:51:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:31,432 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-19 20:51:31,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-19 20:51:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 20:51:31,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:31,434 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-19 20:51:31,435 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-19 20:51:31,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:31,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230884717] [2019-11-19 20:51:31,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:31,481 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-19 20:51:31,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230884717] [2019-11-19 20:51:31,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:31,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:31,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938922500] [2019-11-19 20:51:31,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:31,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:31,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:31,484 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-19 20:51:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:31,634 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-19 20:51:31,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:31,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-19 20:51:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:31,638 INFO L225 Difference]: With dead ends: 712 [2019-11-19 20:51:31,638 INFO L226 Difference]: Without dead ends: 363 [2019-11-19 20:51:31,639 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-19 20:51:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-19 20:51:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-19 20:51:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-19 20:51:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-19 20:51:31,655 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-19 20:51:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:31,656 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-19 20:51:31,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-19 20:51:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-19 20:51:31,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:31,659 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-19 20:51:31,659 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-19 20:51:31,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:31,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709321307] [2019-11-19 20:51:31,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:31,703 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-19 20:51:31,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709321307] [2019-11-19 20:51:31,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:31,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:31,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601256866] [2019-11-19 20:51:31,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:31,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:31,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:31,707 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-19 20:51:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:31,883 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-19 20:51:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:31,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-19 20:51:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:31,886 INFO L225 Difference]: With dead ends: 730 [2019-11-19 20:51:31,886 INFO L226 Difference]: Without dead ends: 381 [2019-11-19 20:51:31,888 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-19 20:51:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-19 20:51:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-19 20:51:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 20:51:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-19 20:51:31,906 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-19 20:51:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:31,906 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-19 20:51:31,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-19 20:51:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 20:51:31,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:31,909 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-19 20:51:31,910 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-19 20:51:31,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:31,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756190369] [2019-11-19 20:51:31,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:31,965 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-19 20:51:31,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756190369] [2019-11-19 20:51:31,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:31,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:31,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134930576] [2019-11-19 20:51:31,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:31,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:31,969 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-19 20:51:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:32,096 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-19 20:51:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:32,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-19 20:51:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:32,100 INFO L225 Difference]: With dead ends: 751 [2019-11-19 20:51:32,100 INFO L226 Difference]: Without dead ends: 381 [2019-11-19 20:51:32,101 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-19 20:51:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-19 20:51:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-19 20:51:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 20:51:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-19 20:51:32,115 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-19 20:51:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:32,116 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-19 20:51:32,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-19 20:51:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 20:51:32,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:32,118 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-19 20:51:32,118 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:32,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-19 20:51:32,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:32,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818632158] [2019-11-19 20:51:32,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:32,165 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-19 20:51:32,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818632158] [2019-11-19 20:51:32,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:32,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:32,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289814252] [2019-11-19 20:51:32,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:32,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:32,167 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-19 20:51:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:32,208 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-19 20:51:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:32,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-19 20:51:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:32,214 INFO L225 Difference]: With dead ends: 747 [2019-11-19 20:51:32,214 INFO L226 Difference]: Without dead ends: 745 [2019-11-19 20:51:32,215 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-19 20:51:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-19 20:51:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-19 20:51:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-19 20:51:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-19 20:51:32,242 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-19 20:51:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:32,242 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-19 20:51:32,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-19 20:51:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 20:51:32,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:32,245 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-19 20:51:32,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-19 20:51:32,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:32,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192722921] [2019-11-19 20:51:32,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:32,256 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:32,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815038816] [2019-11-19 20:51:32,257 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-19 20:51:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:32,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:51:32,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:32,411 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-19 20:51:32,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192722921] [2019-11-19 20:51:32,411 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:32,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815038816] [2019-11-19 20:51:32,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:32,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:51:32,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763807622] [2019-11-19 20:51:32,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:32,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:32,416 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-19 20:51:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:32,477 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-19 20:51:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:32,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 20:51:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:32,484 INFO L225 Difference]: With dead ends: 1851 [2019-11-19 20:51:32,484 INFO L226 Difference]: Without dead ends: 1113 [2019-11-19 20:51:32,486 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-19 20:51:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-19 20:51:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-19 20:51:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-19 20:51:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-19 20:51:32,529 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-19 20:51:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:32,529 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-19 20:51:32,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-19 20:51:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-19 20:51:32,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:32,533 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-19 20:51:32,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:32,747 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:32,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-19 20:51:32,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:32,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117183079] [2019-11-19 20:51:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:32,761 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:32,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864951217] [2019-11-19 20:51:32,762 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-19 20:51:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:32,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:51:32,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:32,889 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-19 20:51:32,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117183079] [2019-11-19 20:51:32,889 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:32,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864951217] [2019-11-19 20:51:32,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:32,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:32,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334837732] [2019-11-19 20:51:32,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:32,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:32,891 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-19 20:51:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:32,968 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-19 20:51:32,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:32,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-19 20:51:32,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:32,976 INFO L225 Difference]: With dead ends: 2219 [2019-11-19 20:51:32,977 INFO L226 Difference]: Without dead ends: 1481 [2019-11-19 20:51:32,980 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-19 20:51:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-19 20:51:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-19 20:51:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-19 20:51:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-19 20:51:33,033 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-19 20:51:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:33,033 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-19 20:51:33,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-19 20:51:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 20:51:33,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:33,038 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-19 20:51:33,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:33,242 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-19 20:51:33,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:33,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421627968] [2019-11-19 20:51:33,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:33,306 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-19 20:51:33,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421627968] [2019-11-19 20:51:33,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:33,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:33,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530210894] [2019-11-19 20:51:33,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:33,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:33,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:33,309 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-19 20:51:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:33,490 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-19 20:51:33,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:33,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-19 20:51:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:33,499 INFO L225 Difference]: With dead ends: 3059 [2019-11-19 20:51:33,499 INFO L226 Difference]: Without dead ends: 1585 [2019-11-19 20:51:33,502 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-19 20:51:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-19 20:51:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-19 20:51:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-19 20:51:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-19 20:51:33,560 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-19 20:51:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:33,561 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-19 20:51:33,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-19 20:51:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 20:51:33,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:33,566 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-19 20:51:33,567 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-19 20:51:33,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:33,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022659127] [2019-11-19 20:51:33,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:33,582 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:33,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739814489] [2019-11-19 20:51:33,583 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-19 20:51:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:33,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:51:33,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:33,711 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-19 20:51:33,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022659127] [2019-11-19 20:51:33,712 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:33,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739814489] [2019-11-19 20:51:33,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:33,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:33,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653736413] [2019-11-19 20:51:33,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:33,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:33,714 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-19 20:51:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:33,805 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-19 20:51:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:33,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-19 20:51:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:33,816 INFO L225 Difference]: With dead ends: 3139 [2019-11-19 20:51:33,817 INFO L226 Difference]: Without dead ends: 1964 [2019-11-19 20:51:33,819 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-19 20:51:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-19 20:51:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-19 20:51:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-19 20:51:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-19 20:51:33,897 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-19 20:51:33,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:33,898 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-19 20:51:33,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-19 20:51:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-19 20:51:33,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:33,907 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-19 20:51:34,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:34,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-19 20:51:34,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:34,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201723918] [2019-11-19 20:51:34,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:34,128 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:34,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820192653] [2019-11-19 20:51:34,129 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-19 20:51:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:34,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:51:34,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:34,279 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-19 20:51:34,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201723918] [2019-11-19 20:51:34,280 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:34,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820192653] [2019-11-19 20:51:34,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:34,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:34,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373888729] [2019-11-19 20:51:34,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:34,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:34,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:34,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:34,283 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-19 20:51:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:34,385 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-19 20:51:34,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:34,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-19 20:51:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:34,403 INFO L225 Difference]: With dead ends: 5743 [2019-11-19 20:51:34,404 INFO L226 Difference]: Without dead ends: 3786 [2019-11-19 20:51:34,407 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-19 20:51:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-19 20:51:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-19 20:51:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-19 20:51:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-19 20:51:34,523 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-19 20:51:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:34,524 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-19 20:51:34,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-19 20:51:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-19 20:51:34,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:34,535 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-19 20:51:34,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:34,739 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-19 20:51:34,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:34,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356274957] [2019-11-19 20:51:34,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:34,753 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:34,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292727955] [2019-11-19 20:51:34,754 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-19 20:51:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:34,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:51:34,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:34,882 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-19 20:51:34,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356274957] [2019-11-19 20:51:34,883 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:34,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292727955] [2019-11-19 20:51:34,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:34,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:34,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626323426] [2019-11-19 20:51:34,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:34,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:34,886 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-19 20:51:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:35,171 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-19 20:51:35,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:35,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-19 20:51:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:35,192 INFO L225 Difference]: With dead ends: 7651 [2019-11-19 20:51:35,192 INFO L226 Difference]: Without dead ends: 3874 [2019-11-19 20:51:35,200 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-19 20:51:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-19 20:51:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-19 20:51:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-19 20:51:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-19 20:51:35,356 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-19 20:51:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:35,357 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-19 20:51:35,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-19 20:51:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-19 20:51:35,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:35,369 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-19 20:51:35,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:35,575 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:35,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-19 20:51:35,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:35,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618493934] [2019-11-19 20:51:35,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:35,764 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-19 20:51:35,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618493934] [2019-11-19 20:51:35,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:35,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:35,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911909486] [2019-11-19 20:51:35,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:35,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:35,767 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-19 20:51:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:36,067 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-19 20:51:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:36,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-19 20:51:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:36,088 INFO L225 Difference]: With dead ends: 7683 [2019-11-19 20:51:36,089 INFO L226 Difference]: Without dead ends: 3906 [2019-11-19 20:51:36,095 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-19 20:51:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-19 20:51:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-19 20:51:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-19 20:51:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-19 20:51:36,216 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-19 20:51:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:36,217 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-19 20:51:36,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-19 20:51:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-19 20:51:36,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:36,228 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-19 20:51:36,228 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-19 20:51:36,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:36,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388631896] [2019-11-19 20:51:36,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:36,243 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:36,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818262896] [2019-11-19 20:51:36,243 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-19 20:51:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:36,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:51:36,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:36,414 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-19 20:51:36,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388631896] [2019-11-19 20:51:36,414 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:36,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818262896] [2019-11-19 20:51:36,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:36,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:36,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712579868] [2019-11-19 20:51:36,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:36,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:36,417 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-19 20:51:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:36,695 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-19 20:51:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:36,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-19 20:51:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:36,716 INFO L225 Difference]: With dead ends: 7561 [2019-11-19 20:51:36,716 INFO L226 Difference]: Without dead ends: 3784 [2019-11-19 20:51:36,724 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-19 20:51:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-19 20:51:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-19 20:51:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-19 20:51:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-19 20:51:36,865 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-19 20:51:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:36,866 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-19 20:51:36,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-19 20:51:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-19 20:51:36,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:36,878 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-19 20:51:37,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:37,082 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-19 20:51:37,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:37,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288088885] [2019-11-19 20:51:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:37,104 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 20:51:37,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562026063] [2019-11-19 20:51:37,105 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-19 20:51:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:37,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:51:37,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:37,323 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-19 20:51:37,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288088885] [2019-11-19 20:51:37,324 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 20:51:37,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562026063] [2019-11-19 20:51:37,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:37,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:37,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395713578] [2019-11-19 20:51:37,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:37,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:37,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:37,328 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-19 20:51:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:37,626 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-19 20:51:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:37,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-19 20:51:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:37,634 INFO L225 Difference]: With dead ends: 7951 [2019-11-19 20:51:37,634 INFO L226 Difference]: Without dead ends: 2307 [2019-11-19 20:51:37,641 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-19 20:51:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-19 20:51:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-19 20:51:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-19 20:51:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-19 20:51:37,719 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-19 20:51:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:37,720 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-19 20:51:37,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-19 20:51:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-19 20:51:37,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:37,730 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-19 20:51:37,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:37,944 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-19 20:51:37,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:37,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626711273] [2019-11-19 20:51:37,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:38,043 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-19 20:51:38,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626711273] [2019-11-19 20:51:38,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:38,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:38,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850896301] [2019-11-19 20:51:38,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:38,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:38,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:38,046 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-19 20:51:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:38,230 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-19 20:51:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:38,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-19 20:51:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:38,237 INFO L225 Difference]: With dead ends: 4829 [2019-11-19 20:51:38,238 INFO L226 Difference]: Without dead ends: 2529 [2019-11-19 20:51:38,241 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-19 20:51:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-19 20:51:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-19 20:51:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-19 20:51:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-19 20:51:38,335 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-19 20:51:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:38,335 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-19 20:51:38,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-19 20:51:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-19 20:51:38,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:38,346 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-19 20:51:38,346 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-19 20:51:38,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:38,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69951394] [2019-11-19 20:51:38,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:38,522 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-19 20:51:38,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69951394] [2019-11-19 20:51:38,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:38,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:38,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588155751] [2019-11-19 20:51:38,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:38,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:38,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:38,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:38,526 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-19 20:51:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:38,726 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-19 20:51:38,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:38,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-19 20:51:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:38,732 INFO L225 Difference]: With dead ends: 4949 [2019-11-19 20:51:38,733 INFO L226 Difference]: Without dead ends: 2499 [2019-11-19 20:51:38,738 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-19 20:51:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-19 20:51:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-19 20:51:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-19 20:51:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-19 20:51:38,807 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-19 20:51:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:38,808 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-19 20:51:38,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-19 20:51:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-19 20:51:38,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:38,817 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-19 20:51:38,818 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-19 20:51:38,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:38,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454792213] [2019-11-19 20:51:38,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:39,045 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-19 20:51:39,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454792213] [2019-11-19 20:51:39,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363425656] [2019-11-19 20:51:39,047 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-19 20:51:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:39,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:51:39,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:39,328 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-19 20:51:39,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:51:39,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 20:51:39,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039029375] [2019-11-19 20:51:39,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:51:39,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:51:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:51:39,332 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-19 20:51:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:39,723 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-11-19 20:51:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:51:39,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-19 20:51:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:39,732 INFO L225 Difference]: With dead ends: 6557 [2019-11-19 20:51:39,732 INFO L226 Difference]: Without dead ends: 3975 [2019-11-19 20:51:39,737 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-19 20:51:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-19 20:51:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-11-19 20:51:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-19 20:51:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-19 20:51:39,809 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-19 20:51:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:39,809 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-19 20:51:39,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:51:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-19 20:51:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-19 20:51:39,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:39,821 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-19 20:51:40,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:40,024 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-19 20:51:40,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:40,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783695698] [2019-11-19 20:51:40,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:40,242 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-19 20:51:40,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783695698] [2019-11-19 20:51:40,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:40,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:40,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126780845] [2019-11-19 20:51:40,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:40,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:40,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:40,245 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-19 20:51:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:40,464 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-19 20:51:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:40,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-19 20:51:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:40,471 INFO L225 Difference]: With dead ends: 5073 [2019-11-19 20:51:40,471 INFO L226 Difference]: Without dead ends: 2546 [2019-11-19 20:51:40,476 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-19 20:51:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-19 20:51:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-19 20:51:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-19 20:51:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-19 20:51:40,610 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-19 20:51:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:40,612 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-19 20:51:40,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-19 20:51:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-19 20:51:40,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:40,627 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-19 20:51:40,627 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-19 20:51:40,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:40,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328936410] [2019-11-19 20:51:40,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:40,836 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-19 20:51:40,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328936410] [2019-11-19 20:51:40,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:40,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:40,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79151969] [2019-11-19 20:51:40,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:40,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:40,839 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-19 20:51:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:41,074 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-19 20:51:41,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:41,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-19 20:51:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:41,081 INFO L225 Difference]: With dead ends: 5277 [2019-11-19 20:51:41,081 INFO L226 Difference]: Without dead ends: 2750 [2019-11-19 20:51:41,086 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-19 20:51:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-19 20:51:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-19 20:51:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-19 20:51:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-19 20:51:41,161 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-19 20:51:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:41,162 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-19 20:51:41,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-19 20:51:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-19 20:51:41,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:41,180 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-19 20:51:41,181 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:41,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-19 20:51:41,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:41,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26877613] [2019-11-19 20:51:41,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:41,457 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-19 20:51:41,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26877613] [2019-11-19 20:51:41,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:51:41,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:51:41,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481151470] [2019-11-19 20:51:41,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:51:41,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:51:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:51:41,460 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-19 20:51:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:41,644 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-19 20:51:41,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:51:41,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-19 20:51:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:41,651 INFO L225 Difference]: With dead ends: 5697 [2019-11-19 20:51:41,651 INFO L226 Difference]: Without dead ends: 2966 [2019-11-19 20:51:41,655 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-19 20:51:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-19 20:51:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-19 20:51:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-19 20:51:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-19 20:51:41,751 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-19 20:51:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:41,751 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-19 20:51:41,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:51:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-19 20:51:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-19 20:51:41,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:51:41,760 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-19 20:51:41,761 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:51:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:51:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-19 20:51:41,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:51:41,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224811060] [2019-11-19 20:51:41,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:51:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:41,994 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-19 20:51:41,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224811060] [2019-11-19 20:51:41,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736862744] [2019-11-19 20:51:41,995 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-19 20:51:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:51:42,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:51:42,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:51:42,413 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-19 20:51:42,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:51:42,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 20:51:42,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499391531] [2019-11-19 20:51:42,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:51:42,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:51:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:51:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:51:42,417 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-19 20:51:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:51:42,616 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-19 20:51:42,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:51:42,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-19 20:51:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:51:42,618 INFO L225 Difference]: With dead ends: 4704 [2019-11-19 20:51:42,618 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:51:42,622 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-19 20:51:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:51:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:51:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:51:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:51:42,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-19 20:51:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:51:42,623 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:51:42,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:51:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:51:42,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:51:42,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:51:42,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:51:43,455 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-19 20:51:43,639 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-19 20:51:43,957 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-19 20:51:44,151 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-19 20:51:44,408 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-19 20:51:44,589 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-19 20:51:44,772 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-19 20:51:44,938 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-19 20:51:45,108 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-19 20:51:45,317 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-19 20:51:45,504 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-19 20:51:45,701 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-19 20:51:45,871 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-19 20:51:46,101 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-19 20:51:46,369 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-19 20:51:46,515 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-19 20:51:46,751 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-19 20:51:46,938 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-19 20:51:47,238 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-19 20:51:47,382 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-19 20:51:47,536 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-19 20:51:47,540 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-19 20:51:47,540 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-19 20:51:47,540 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-19 20:51:47,540 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-19 20:51:47,540 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-19 20:51:47,540 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-19 20:51:47,541 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 592) 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-19 20:51:47,541 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 624) 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-19 20:51:47,541 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-19 20:51:47,541 INFO L444 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,541 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-19 20:51:47,541 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-19 20:51:47,542 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-19 20:51:47,543 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-19 20:51:47,543 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-19 20:51:47,543 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 20:51:47,543 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 602) 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-19 20:51:47,544 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 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 .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) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-19 20:51:47,544 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-19 20:51:47,544 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-19 20:51:47,545 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-19 20:51:47,545 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-19 20:51:47,545 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-19 20:51:47,545 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,545 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-19 20:51:47,545 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-19 20:51:47,546 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-19 20:51:47,546 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-19 20:51:47,546 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 20:51:47,546 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-19 20:51:47,547 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-19 20:51:47,547 INFO L447 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-19 20:51:47,547 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-19 20:51:47,547 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-19 20:51:47,547 INFO L440 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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))) (.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 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-19 20:51:47,548 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-19 20:51:47,548 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,548 INFO L447 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-19 20:51:47,548 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-19 20:51:47,548 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-19 20:51:47,548 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-19 20:51:47,549 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-19 20:51:47,549 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-19 20:51:47,549 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 600) 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-19 20:51:47,549 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (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))))) [2019-11-19 20:51:47,550 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-19 20:51:47,550 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (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) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-11-19 20:51:47,550 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-19 20:51:47,550 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-19 20:51:47,550 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-19 20:51:47,551 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-19 20:51:47,551 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-19 20:51:47,551 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-19 20:51:47,551 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-19 20:51:47,551 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-19 20:51:47,551 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-19 20:51:47,552 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-19 20:51:47,552 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-19 20:51:47,552 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-19 20:51:47,552 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-19 20:51:47,552 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-19 20:51:47,553 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-19 20:51:47,553 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-19 20:51:47,553 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 598) 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-19 20:51:47,553 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (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))))) [2019-11-19 20:51:47,554 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,554 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:51:47,554 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-19 20:51:47,554 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-19 20:51:47,554 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-19 20:51:47,554 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-19 20:51:47,555 INFO L440 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-11-19 20:51:47,555 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-19 20:51:47,555 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-19 20:51:47,555 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (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) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-19 20:51:47,555 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-19 20:51:47,556 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-19 20:51:47,556 INFO L447 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-19 20:51:47,556 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-19 20:51:47,556 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-19 20:51:47,556 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-19 20:51:47,557 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-19 20:51:47,557 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-19 20:51:47,557 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-19 20:51:47,557 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-19 20:51:47,557 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:51:47,557 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,558 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 596) 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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 20:51:47,558 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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))) (.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 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-19 20:51:47,558 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 617) 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-19 20:51:47,559 INFO L440 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (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 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-19 20:51:47,559 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-19 20:51:47,559 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-19 20:51:47,559 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-19 20:51:47,559 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-19 20:51:47,559 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-19 20:51:47,560 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-19 20:51:47,560 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-19 20:51:47,560 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-19 20:51:47,560 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-19 20:51:47,560 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-19 20:51:47,560 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-19 20:51:47,561 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:51:47,561 INFO L447 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-19 20:51:47,561 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-19 20:51:47,561 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-19 20:51:47,561 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-19 20:51:47,561 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-19 20:51:47,562 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-19 20:51:47,562 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (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))) [2019-11-19 20:51:47,562 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (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 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 20:51:47,562 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,563 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-19 20:51:47,563 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-19 20:51:47,563 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-19 20:51:47,563 INFO L444 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-19 20:51:47,563 INFO L444 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-19 20:51:47,563 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-19 20:51:47,564 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-11-19 20:51:47,564 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-19 20:51:47,564 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-19 20:51:47,564 INFO L444 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-19 20:51:47,564 INFO L444 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-19 20:51:47,564 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-19 20:51:47,565 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-19 20:51:47,565 INFO L440 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (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))))) [2019-11-19 20:51:47,565 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-19 20:51:47,565 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-19 20:51:47,565 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-19 20:51:47,566 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-19 20:51:47,566 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (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 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-19 20:51:47,566 INFO L440 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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))) (.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 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-19 20:51:47,567 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 603) 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 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 20:51:47,567 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (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))))) [2019-11-19 20:51:47,567 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 20:51:47,567 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-19 20:51:47,567 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-19 20:51:47,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:51:47 BoogieIcfgContainer [2019-11-19 20:51:47,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:51:47,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:51:47,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:51:47,650 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:51:47,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:27" (3/4) ... [2019-11-19 20:51:47,655 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:51:47,684 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:51:47,685 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:51:47,809 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:51:47,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:51:47,811 INFO L168 Benchmark]: Toolchain (without parser) took 21714.52 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 963.1 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:51:47,811 INFO L168 Benchmark]: CDTParser took 0.28 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-19 20:51:47,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:51:47,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.03 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-19 20:51:47,812 INFO L168 Benchmark]: Boogie Preprocessor took 61.40 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-19 20:51:47,813 INFO L168 Benchmark]: RCFGBuilder took 869.27 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:51:47,813 INFO L168 Benchmark]: TraceAbstraction took 20006.97 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 871.4 MB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -922.7 MB). Peak memory consumption was 919.1 MB. Max. memory is 11.5 GB. [2019-11-19 20:51:47,813 INFO L168 Benchmark]: Witness Printer took 160.18 ms. Allocated memory is still 2.0 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:51:47,815 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.28 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 536.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.03 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. * Boogie Preprocessor took 61.40 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. * RCFGBuilder took 869.27 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20006.97 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 871.4 MB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -922.7 MB). Peak memory consumption was 919.1 MB. Max. memory is 11.5 GB. * Witness Printer took 160.18 ms. Allocated memory is still 2.0 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: 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: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(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: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((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 == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - 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 == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(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: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: 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 && !(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: 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 == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(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: 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: 98]: Loop Invariant Derived loop invariant: 1 - 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 == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(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: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - 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: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - 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 == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - 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: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) || ((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8497)) && !(s__state == 8496)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) && !(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 == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((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)) || (((((((((((blastFlag <= 2 && s__state <= 8672) && !(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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 19.8s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 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.2s 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.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 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...