./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_3.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 04e0282fb07d3e422f01aa279aee523182698ba7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:50,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:50,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:50,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:50,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:50,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:50,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:50,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:50,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:50,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:50,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:50,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:50,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:50,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:50,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:50,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:50,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:50,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:50,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:50,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:50,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:50,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:50,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:50,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:50,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:50,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:50,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:50,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:50,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:50,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:50,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:50,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:50,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:50,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:50,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:50,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:50,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:50,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:50,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:50,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:50,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:50,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:50,205 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:50,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:50,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:50,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:50,207 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:50,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:50,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:50,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:50,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:50,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:50,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:50,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:50,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:50,210 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:50,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:50,210 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:50,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:50,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:50,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:50,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:50,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:50,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:50,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:50,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:50,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:50,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:50,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:50,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:50,214 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 -> 04e0282fb07d3e422f01aa279aee523182698ba7 [2019-11-27 22:35:50,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:50,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:50,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:50,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:50,550 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:50,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-11-27 22:35:50,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12e399de/362ac65a7db24e85bb55a9e458e805b2/FLAG8cb2ca072 [2019-11-27 22:35:51,167 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:51,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-11-27 22:35:51,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12e399de/362ac65a7db24e85bb55a9e458e805b2/FLAG8cb2ca072 [2019-11-27 22:35:51,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12e399de/362ac65a7db24e85bb55a9e458e805b2 [2019-11-27 22:35:51,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:51,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:51,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:51,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:51,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:51,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:51" (1/1) ... [2019-11-27 22:35:51,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f74f45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:51, skipping insertion in model container [2019-11-27 22:35:51,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:51" (1/1) ... [2019-11-27 22:35:51,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:51,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:51,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:51,961 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:52,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:52,152 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:52,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52 WrapperNode [2019-11-27 22:35:52,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:52,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:52,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:52,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:52,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:52,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:52,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:52,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:52,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... [2019-11-27 22:35:52,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:52,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:52,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:52,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:52,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:52,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:52,606 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:53,137 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:35:53,138 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:35:53,142 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:53,143 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:53,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:53 BoogieIcfgContainer [2019-11-27 22:35:53,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:53,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:53,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:53,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:53,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:51" (1/3) ... [2019-11-27 22:35:53,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d5e70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:53, skipping insertion in model container [2019-11-27 22:35:53,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:52" (2/3) ... [2019-11-27 22:35:53,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d5e70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:53, skipping insertion in model container [2019-11-27 22:35:53,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:53" (3/3) ... [2019-11-27 22:35:53,155 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-11-27 22:35:53,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:53,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:53,189 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:53,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:53,220 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:53,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:53,220 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:53,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:53,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:53,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:53,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-27 22:35:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:35:53,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:53,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:53,255 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-11-27 22:35:53,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:53,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32042799] [2019-11-27 22:35:53,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:53,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32042799] [2019-11-27 22:35:53,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:53,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:53,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891947184] [2019-11-27 22:35:53,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:53,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:53,540 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-27 22:35:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:53,885 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-27 22:35:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:53,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:35:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:53,900 INFO L225 Difference]: With dead ends: 327 [2019-11-27 22:35:53,901 INFO L226 Difference]: Without dead ends: 174 [2019-11-27 22:35:53,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-27 22:35:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-27 22:35:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-27 22:35:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-27 22:35:53,967 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-27 22:35:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:53,969 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-27 22:35:53,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-27 22:35:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:35:53,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:53,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:53,973 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-11-27 22:35:53,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:53,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889255194] [2019-11-27 22:35:53,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:54,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889255194] [2019-11-27 22:35:54,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:54,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:54,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311645013] [2019-11-27 22:35:54,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:54,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,110 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-27 22:35:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:54,350 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-27 22:35:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:54,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:35:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:54,354 INFO L225 Difference]: With dead ends: 379 [2019-11-27 22:35:54,354 INFO L226 Difference]: Without dead ends: 215 [2019-11-27 22:35:54,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-27 22:35:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-27 22:35:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-27 22:35:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-27 22:35:54,377 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-27 22:35:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:54,378 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-27 22:35:54,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-27 22:35:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-27 22:35:54,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:54,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:54,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-11-27 22:35:54,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:54,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773175829] [2019-11-27 22:35:54,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:54,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773175829] [2019-11-27 22:35:54,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:54,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:54,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572910835] [2019-11-27 22:35:54,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:54,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:54,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,503 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-27 22:35:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:54,701 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-27 22:35:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:54,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-27 22:35:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:54,704 INFO L225 Difference]: With dead ends: 444 [2019-11-27 22:35:54,705 INFO L226 Difference]: Without dead ends: 241 [2019-11-27 22:35:54,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-27 22:35:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-27 22:35:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-27 22:35:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-27 22:35:54,728 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-27 22:35:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:54,728 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-27 22:35:54,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-27 22:35:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:35:54,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:54,733 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:54,733 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-11-27 22:35:54,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:54,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130838495] [2019-11-27 22:35:54,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:54,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130838495] [2019-11-27 22:35:54,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:54,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:54,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200247953] [2019-11-27 22:35:54,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:54,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,794 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-27 22:35:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:54,947 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-27 22:35:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:54,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:35:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:54,950 INFO L225 Difference]: With dead ends: 492 [2019-11-27 22:35:54,951 INFO L226 Difference]: Without dead ends: 258 [2019-11-27 22:35:54,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-27 22:35:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-27 22:35:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-27 22:35:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-27 22:35:54,970 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-27 22:35:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:54,971 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-27 22:35:54,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-27 22:35:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:35:54,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:54,974 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:54,975 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-11-27 22:35:54,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:54,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317829537] [2019-11-27 22:35:54,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:55,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317829537] [2019-11-27 22:35:55,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588155819] [2019-11-27 22:35:55,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,069 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-27 22:35:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,267 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-27 22:35:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:35:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,270 INFO L225 Difference]: With dead ends: 551 [2019-11-27 22:35:55,270 INFO L226 Difference]: Without dead ends: 302 [2019-11-27 22:35:55,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-27 22:35:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-27 22:35:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-27 22:35:55,286 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-27 22:35:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,287 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-27 22:35:55,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-27 22:35:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:55,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,289 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:55,289 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-11-27 22:35:55,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630667231] [2019-11-27 22:35:55,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:55,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630667231] [2019-11-27 22:35:55,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064181729] [2019-11-27 22:35:55,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,357 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-27 22:35:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,510 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-27 22:35:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,513 INFO L225 Difference]: With dead ends: 591 [2019-11-27 22:35:55,513 INFO L226 Difference]: Without dead ends: 300 [2019-11-27 22:35:55,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-27 22:35:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-27 22:35:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-27 22:35:55,525 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-27 22:35:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,526 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-27 22:35:55,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-27 22:35:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:55,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,528 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:55,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-11-27 22:35:55,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909584887] [2019-11-27 22:35:55,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:55,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909584887] [2019-11-27 22:35:55,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328762995] [2019-11-27 22:35:55,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,575 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-27 22:35:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,774 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-27 22:35:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,777 INFO L225 Difference]: With dead ends: 593 [2019-11-27 22:35:55,777 INFO L226 Difference]: Without dead ends: 300 [2019-11-27 22:35:55,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-27 22:35:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-27 22:35:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-27 22:35:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-27 22:35:55,790 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-27 22:35:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,791 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-27 22:35:55,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-27 22:35:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-27 22:35:55,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,793 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:55,793 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-11-27 22:35:55,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016258568] [2019-11-27 22:35:55,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:35:55,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016258568] [2019-11-27 22:35:55,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:55,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029724012] [2019-11-27 22:35:55,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,839 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-27 22:35:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:55,952 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-27 22:35:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:55,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-27 22:35:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:55,955 INFO L225 Difference]: With dead ends: 594 [2019-11-27 22:35:55,955 INFO L226 Difference]: Without dead ends: 305 [2019-11-27 22:35:55,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-27 22:35:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-27 22:35:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-27 22:35:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-27 22:35:55,968 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-27 22:35:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:55,968 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-27 22:35:55,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-27 22:35:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-27 22:35:55,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,970 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:55,970 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-11-27 22:35:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129981958] [2019-11-27 22:35:55,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:56,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129981958] [2019-11-27 22:35:56,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310665728] [2019-11-27 22:35:56,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,021 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-27 22:35:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,174 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-27 22:35:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-27 22:35:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,177 INFO L225 Difference]: With dead ends: 634 [2019-11-27 22:35:56,177 INFO L226 Difference]: Without dead ends: 336 [2019-11-27 22:35:56,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-27 22:35:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-27 22:35:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-27 22:35:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-27 22:35:56,191 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-27 22:35:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,192 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-27 22:35:56,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-27 22:35:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:35:56,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,194 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,194 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-11-27 22:35:56,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667846548] [2019-11-27 22:35:56,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:56,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667846548] [2019-11-27 22:35:56,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207766950] [2019-11-27 22:35:56,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,234 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-27 22:35:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,381 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-27 22:35:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:35:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,384 INFO L225 Difference]: With dead ends: 663 [2019-11-27 22:35:56,384 INFO L226 Difference]: Without dead ends: 336 [2019-11-27 22:35:56,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-27 22:35:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-27 22:35:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-27 22:35:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-27 22:35:56,398 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-27 22:35:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,398 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-27 22:35:56,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-27 22:35:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:35:56,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,400 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,401 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-11-27 22:35:56,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555965990] [2019-11-27 22:35:56,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:56,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555965990] [2019-11-27 22:35:56,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135711026] [2019-11-27 22:35:56,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,437 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-27 22:35:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,582 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-27 22:35:56,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:35:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,585 INFO L225 Difference]: With dead ends: 696 [2019-11-27 22:35:56,585 INFO L226 Difference]: Without dead ends: 369 [2019-11-27 22:35:56,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-27 22:35:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-27 22:35:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-27 22:35:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-27 22:35:56,603 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-27 22:35:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,604 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-27 22:35:56,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-27 22:35:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:35:56,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,611 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,612 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-11-27 22:35:56,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379176579] [2019-11-27 22:35:56,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:35:56,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379176579] [2019-11-27 22:35:56,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745314085] [2019-11-27 22:35:56,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,653 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-27 22:35:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,838 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-27 22:35:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:35:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,842 INFO L225 Difference]: With dead ends: 723 [2019-11-27 22:35:56,843 INFO L226 Difference]: Without dead ends: 369 [2019-11-27 22:35:56,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-27 22:35:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-27 22:35:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-27 22:35:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-27 22:35:56,861 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-27 22:35:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,861 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-27 22:35:56,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-27 22:35:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:35:56,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,865 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,865 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-11-27 22:35:56,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570960701] [2019-11-27 22:35:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:56,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570960701] [2019-11-27 22:35:56,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:56,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228390747] [2019-11-27 22:35:56,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,911 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-27 22:35:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,091 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-27 22:35:57,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:35:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,095 INFO L225 Difference]: With dead ends: 740 [2019-11-27 22:35:57,095 INFO L226 Difference]: Without dead ends: 386 [2019-11-27 22:35:57,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-27 22:35:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-27 22:35:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-27 22:35:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-27 22:35:57,114 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-27 22:35:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,114 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-27 22:35:57,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-27 22:35:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:35:57,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,117 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:57,117 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-11-27 22:35:57,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179330272] [2019-11-27 22:35:57,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:57,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179330272] [2019-11-27 22:35:57,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952951290] [2019-11-27 22:35:57,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,162 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-27 22:35:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,352 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-27 22:35:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:35:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,355 INFO L225 Difference]: With dead ends: 761 [2019-11-27 22:35:57,356 INFO L226 Difference]: Without dead ends: 386 [2019-11-27 22:35:57,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-27 22:35:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-27 22:35:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-27 22:35:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-27 22:35:57,378 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-27 22:35:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,378 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-27 22:35:57,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-27 22:35:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 22:35:57,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,382 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:57,383 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-11-27 22:35:57,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109360907] [2019-11-27 22:35:57,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:35:57,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109360907] [2019-11-27 22:35:57,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851687168] [2019-11-27 22:35:57,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,476 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-27 22:35:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,547 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-27 22:35:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 22:35:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,554 INFO L225 Difference]: With dead ends: 757 [2019-11-27 22:35:57,555 INFO L226 Difference]: Without dead ends: 755 [2019-11-27 22:35:57,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-27 22:35:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-27 22:35:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-27 22:35:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-27 22:35:57,598 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-27 22:35:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,599 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-27 22:35:57,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-27 22:35:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:35:57,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,603 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:57,603 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-11-27 22:35:57,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962663914] [2019-11-27 22:35:57,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:57,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962663914] [2019-11-27 22:35:57,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481184314] [2019-11-27 22:35:57,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,669 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-27 22:35:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,856 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-11-27 22:35:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:35:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,861 INFO L225 Difference]: With dead ends: 1587 [2019-11-27 22:35:57,862 INFO L226 Difference]: Without dead ends: 839 [2019-11-27 22:35:57,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-27 22:35:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-11-27 22:35:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-27 22:35:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-11-27 22:35:57,907 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-11-27 22:35:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,907 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-11-27 22:35:57,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-11-27 22:35:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-27 22:35:57,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,910 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, 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] [2019-11-27 22:35:57,911 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-11-27 22:35:57,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819494402] [2019-11-27 22:35:57,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:35:57,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819494402] [2019-11-27 22:35:57,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:57,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358610781] [2019-11-27 22:35:57,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,952 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-11-27 22:35:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,147 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-11-27 22:35:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-27 22:35:58,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,153 INFO L225 Difference]: With dead ends: 1663 [2019-11-27 22:35:58,153 INFO L226 Difference]: Without dead ends: 835 [2019-11-27 22:35:58,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-27 22:35:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-11-27 22:35:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-11-27 22:35:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-11-27 22:35:58,198 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-11-27 22:35:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,199 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-11-27 22:35:58,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-11-27 22:35:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-27 22:35:58,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,203 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:35:58,203 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-11-27 22:35:58,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202512210] [2019-11-27 22:35:58,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-27 22:35:58,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202512210] [2019-11-27 22:35:58,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:58,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047011167] [2019-11-27 22:35:58,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,275 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-11-27 22:35:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,460 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-11-27 22:35:58,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-27 22:35:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,466 INFO L225 Difference]: With dead ends: 1723 [2019-11-27 22:35:58,467 INFO L226 Difference]: Without dead ends: 903 [2019-11-27 22:35:58,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-27 22:35:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-11-27 22:35:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-11-27 22:35:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-11-27 22:35:58,524 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-11-27 22:35:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,525 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-11-27 22:35:58,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-11-27 22:35:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-27 22:35:58,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,535 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-27 22:35:58,535 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-11-27 22:35:58,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255246884] [2019-11-27 22:35:58,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-27 22:35:58,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255246884] [2019-11-27 22:35:58,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:58,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866427634] [2019-11-27 22:35:58,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,616 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-11-27 22:35:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,845 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-11-27 22:35:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-27 22:35:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,852 INFO L225 Difference]: With dead ends: 1795 [2019-11-27 22:35:58,852 INFO L226 Difference]: Without dead ends: 899 [2019-11-27 22:35:58,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-11-27 22:35:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-11-27 22:35:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-27 22:35:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-11-27 22:35:58,894 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-11-27 22:35:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,894 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-11-27 22:35:58,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-11-27 22:35:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-27 22:35:58,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,898 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:58,898 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-11-27 22:35:58,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860032790] [2019-11-27 22:35:58,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-27 22:35:58,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860032790] [2019-11-27 22:35:58,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:58,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564897671] [2019-11-27 22:35:58,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,982 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-11-27 22:35:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,236 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-11-27 22:35:59,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-27 22:35:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,244 INFO L225 Difference]: With dead ends: 1855 [2019-11-27 22:35:59,245 INFO L226 Difference]: Without dead ends: 967 [2019-11-27 22:35:59,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-11-27 22:35:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-11-27 22:35:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-27 22:35:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-11-27 22:35:59,352 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-11-27 22:35:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,353 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-11-27 22:35:59,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-11-27 22:35:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-27 22:35:59,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,359 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:59,359 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-11-27 22:35:59,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235283245] [2019-11-27 22:35:59,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-27 22:35:59,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235283245] [2019-11-27 22:35:59,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:59,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090357594] [2019-11-27 22:35:59,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:59,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,420 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-11-27 22:35:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,605 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-11-27 22:35:59,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-27 22:35:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,611 INFO L225 Difference]: With dead ends: 1923 [2019-11-27 22:35:59,611 INFO L226 Difference]: Without dead ends: 963 [2019-11-27 22:35:59,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-27 22:35:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-11-27 22:35:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-11-27 22:35:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-11-27 22:35:59,655 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-11-27 22:35:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,655 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-11-27 22:35:59,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-11-27 22:35:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-27 22:35:59,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,660 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:59,660 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,660 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-11-27 22:35:59,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509991012] [2019-11-27 22:35:59,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-27 22:35:59,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509991012] [2019-11-27 22:35:59,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292570704] [2019-11-27 22:35:59,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,726 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-11-27 22:35:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,916 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-11-27 22:35:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-27 22:35:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,923 INFO L225 Difference]: With dead ends: 1987 [2019-11-27 22:35:59,923 INFO L226 Difference]: Without dead ends: 1035 [2019-11-27 22:35:59,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-27 22:35:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-11-27 22:35:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-27 22:35:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-11-27 22:35:59,972 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-11-27 22:35:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,972 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-11-27 22:35:59,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-11-27 22:35:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-27 22:35:59,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,977 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:59,977 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-11-27 22:35:59,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84697068] [2019-11-27 22:35:59,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-27 22:36:00,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84697068] [2019-11-27 22:36:00,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:00,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:36:00,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773300299] [2019-11-27 22:36:00,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:00,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,051 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-11-27 22:36:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:00,224 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-11-27 22:36:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:00,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-27 22:36:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:00,230 INFO L225 Difference]: With dead ends: 2037 [2019-11-27 22:36:00,231 INFO L226 Difference]: Without dead ends: 1035 [2019-11-27 22:36:00,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-27 22:36:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-11-27 22:36:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-27 22:36:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-11-27 22:36:00,282 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-11-27 22:36:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:00,282 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-11-27 22:36:00,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-11-27 22:36:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-27 22:36:00,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:00,287 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:00,287 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:00,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-11-27 22:36:00,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:00,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949710601] [2019-11-27 22:36:00,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-27 22:36:00,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949710601] [2019-11-27 22:36:00,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:00,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:36:00,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161850406] [2019-11-27 22:36:00,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:00,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:00,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,354 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-11-27 22:36:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:00,526 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-11-27 22:36:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:00,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-27 22:36:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:00,532 INFO L225 Difference]: With dead ends: 2019 [2019-11-27 22:36:00,533 INFO L226 Difference]: Without dead ends: 1017 [2019-11-27 22:36:00,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-11-27 22:36:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-11-27 22:36:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-27 22:36:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-11-27 22:36:00,584 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-11-27 22:36:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:00,584 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-11-27 22:36:00,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-11-27 22:36:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-27 22:36:00,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:00,589 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:00,589 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-11-27 22:36:00,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:00,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999900265] [2019-11-27 22:36:00,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-27 22:36:00,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999900265] [2019-11-27 22:36:00,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:00,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:36:00,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389404610] [2019-11-27 22:36:00,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:00,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,693 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-11-27 22:36:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:00,888 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-11-27 22:36:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:00,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-27 22:36:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:00,896 INFO L225 Difference]: With dead ends: 2019 [2019-11-27 22:36:00,896 INFO L226 Difference]: Without dead ends: 999 [2019-11-27 22:36:00,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-27 22:36:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-11-27 22:36:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-27 22:36:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-11-27 22:36:00,956 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-11-27 22:36:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:00,956 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-11-27 22:36:00,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-11-27 22:36:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-27 22:36:00,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:00,964 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:00,965 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-11-27 22:36:00,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:00,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617943561] [2019-11-27 22:36:00,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-27 22:36:01,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617943561] [2019-11-27 22:36:01,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:01,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:36:01,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059336326] [2019-11-27 22:36:01,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:01,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,087 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-11-27 22:36:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:01,299 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-11-27 22:36:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:01,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-27 22:36:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:01,307 INFO L225 Difference]: With dead ends: 2029 [2019-11-27 22:36:01,308 INFO L226 Difference]: Without dead ends: 1045 [2019-11-27 22:36:01,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-27 22:36:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-11-27 22:36:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-11-27 22:36:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-11-27 22:36:01,390 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-11-27 22:36:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:01,390 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-11-27 22:36:01,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-11-27 22:36:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-27 22:36:01,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:01,399 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:01,400 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-11-27 22:36:01,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:01,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189315931] [2019-11-27 22:36:01,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-27 22:36:01,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189315931] [2019-11-27 22:36:01,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:01,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:36:01,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683509026] [2019-11-27 22:36:01,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:01,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:01,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,500 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-11-27 22:36:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:01,667 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-11-27 22:36:01,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:01,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-27 22:36:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:01,672 INFO L225 Difference]: With dead ends: 2075 [2019-11-27 22:36:01,673 INFO L226 Difference]: Without dead ends: 1037 [2019-11-27 22:36:01,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-11-27 22:36:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-11-27 22:36:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-11-27 22:36:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-11-27 22:36:01,731 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-11-27 22:36:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:01,732 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-11-27 22:36:01,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-11-27 22:36:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-27 22:36:01,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:01,740 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:01,741 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-11-27 22:36:01,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:01,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117834580] [2019-11-27 22:36:01,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-27 22:36:01,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117834580] [2019-11-27 22:36:01,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884747813] [2019-11-27 22:36:01,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:02,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:36:02,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-27 22:36:02,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:36:02,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:36:02,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932969131] [2019-11-27 22:36:02,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:02,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:02,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:02,257 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 3 states. [2019-11-27 22:36:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:02,403 INFO L93 Difference]: Finished difference Result 2561 states and 3720 transitions. [2019-11-27 22:36:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:02,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-11-27 22:36:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:02,414 INFO L225 Difference]: With dead ends: 2561 [2019-11-27 22:36:02,414 INFO L226 Difference]: Without dead ends: 1539 [2019-11-27 22:36:02,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-27 22:36:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2019-11-27 22:36:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-11-27 22:36:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2235 transitions. [2019-11-27 22:36:02,569 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2235 transitions. Word has length 261 [2019-11-27 22:36:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:02,570 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 2235 transitions. [2019-11-27 22:36:02,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2235 transitions. [2019-11-27 22:36:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-27 22:36:02,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:02,580 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:02,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:02,786 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-11-27 22:36:02,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:02,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324016149] [2019-11-27 22:36:02,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-27 22:36:02,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324016149] [2019-11-27 22:36:02,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:02,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:02,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475339172] [2019-11-27 22:36:02,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:02,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:02,951 INFO L87 Difference]: Start difference. First operand 1539 states and 2235 transitions. Second operand 3 states. [2019-11-27 22:36:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:03,067 INFO L93 Difference]: Finished difference Result 4522 states and 6563 transitions. [2019-11-27 22:36:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:03,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-27 22:36:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:03,083 INFO L225 Difference]: With dead ends: 4522 [2019-11-27 22:36:03,084 INFO L226 Difference]: Without dead ends: 2990 [2019-11-27 22:36:03,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-11-27 22:36:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2988. [2019-11-27 22:36:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-11-27 22:36:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4329 transitions. [2019-11-27 22:36:03,264 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4329 transitions. Word has length 268 [2019-11-27 22:36:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:03,265 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 4329 transitions. [2019-11-27 22:36:03,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4329 transitions. [2019-11-27 22:36:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-27 22:36:03,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:03,284 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:03,284 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-11-27 22:36:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:03,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404949942] [2019-11-27 22:36:03,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-27 22:36:03,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404949942] [2019-11-27 22:36:03,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:03,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:03,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860494841] [2019-11-27 22:36:03,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:03,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:03,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:03,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,479 INFO L87 Difference]: Start difference. First operand 2988 states and 4329 transitions. Second operand 3 states. [2019-11-27 22:36:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:03,823 INFO L93 Difference]: Finished difference Result 6089 states and 8839 transitions. [2019-11-27 22:36:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:03,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-27 22:36:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:03,838 INFO L225 Difference]: With dead ends: 6089 [2019-11-27 22:36:03,839 INFO L226 Difference]: Without dead ends: 1991 [2019-11-27 22:36:03,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-27 22:36:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1971. [2019-11-27 22:36:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-27 22:36:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2807 transitions. [2019-11-27 22:36:03,952 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2807 transitions. Word has length 305 [2019-11-27 22:36:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:03,952 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2807 transitions. [2019-11-27 22:36:03,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2807 transitions. [2019-11-27 22:36:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-27 22:36:03,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:03,962 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, 1, 1] [2019-11-27 22:36:03,962 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1127702344, now seen corresponding path program 1 times [2019-11-27 22:36:03,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:03,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853613981] [2019-11-27 22:36:03,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:36:04,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853613981] [2019-11-27 22:36:04,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876052848] [2019-11-27 22:36:04,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:04,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:04,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:36:04,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:36:04,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:36:04,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555600074] [2019-11-27 22:36:04,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:36:04,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:04,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:36:04,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:36:04,479 INFO L87 Difference]: Start difference. First operand 1971 states and 2807 transitions. Second operand 4 states. [2019-11-27 22:36:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:04,886 INFO L93 Difference]: Finished difference Result 4561 states and 6484 transitions. [2019-11-27 22:36:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:36:04,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-11-27 22:36:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:04,917 INFO L225 Difference]: With dead ends: 4561 [2019-11-27 22:36:04,917 INFO L226 Difference]: Without dead ends: 2553 [2019-11-27 22:36:04,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-11-27 22:36:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 1942. [2019-11-27 22:36:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-27 22:36:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-11-27 22:36:05,048 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 371 [2019-11-27 22:36:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:05,049 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-11-27 22:36:05,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:36:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-11-27 22:36:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-11-27 22:36:05,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:05,075 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, 1, 1] [2019-11-27 22:36:05,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:05,281 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-11-27 22:36:05,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:05,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771580539] [2019-11-27 22:36:05,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:36:05,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771580539] [2019-11-27 22:36:05,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771732914] [2019-11-27 22:36:05,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:06,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:36:06,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:36:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:36:06,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:36:06,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:36:06,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126911441] [2019-11-27 22:36:06,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:36:06,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:06,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:36:06,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:36:06,389 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-11-27 22:36:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:06,713 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-11-27 22:36:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:36:06,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-11-27 22:36:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:06,721 INFO L225 Difference]: With dead ends: 4797 [2019-11-27 22:36:06,721 INFO L226 Difference]: Without dead ends: 2724 [2019-11-27 22:36:06,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:36:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-11-27 22:36:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-11-27 22:36:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-27 22:36:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-11-27 22:36:06,803 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-11-27 22:36:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:06,804 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-11-27 22:36:06,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:36:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-11-27 22:36:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-11-27 22:36:06,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:06,820 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:07,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:36:07,026 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-11-27 22:36:07,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:07,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894686342] [2019-11-27 22:36:07,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-27 22:36:07,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894686342] [2019-11-27 22:36:07,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:07,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:07,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172605519] [2019-11-27 22:36:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:07,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:07,539 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-11-27 22:36:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:07,759 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-11-27 22:36:07,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:07,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-11-27 22:36:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:07,767 INFO L225 Difference]: With dead ends: 3917 [2019-11-27 22:36:07,767 INFO L226 Difference]: Without dead ends: 1982 [2019-11-27 22:36:07,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-27 22:36:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-11-27 22:36:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-27 22:36:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-11-27 22:36:07,869 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-11-27 22:36:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:07,870 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-11-27 22:36:07,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-11-27 22:36:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-27 22:36:07,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:07,906 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:07,906 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-11-27 22:36:07,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:07,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841623261] [2019-11-27 22:36:07,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-27 22:36:08,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841623261] [2019-11-27 22:36:08,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:08,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:08,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883690952] [2019-11-27 22:36:08,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:08,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:08,373 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-11-27 22:36:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:08,617 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-11-27 22:36:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:08,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-11-27 22:36:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:08,623 INFO L225 Difference]: With dead ends: 3892 [2019-11-27 22:36:08,623 INFO L226 Difference]: Without dead ends: 1957 [2019-11-27 22:36:08,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-11-27 22:36:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-11-27 22:36:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-11-27 22:36:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-11-27 22:36:08,750 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-11-27 22:36:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:08,751 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-11-27 22:36:08,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-11-27 22:36:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-11-27 22:36:08,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:08,771 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:08,772 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-11-27 22:36:08,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:08,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601116145] [2019-11-27 22:36:08,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-27 22:36:09,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601116145] [2019-11-27 22:36:09,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:09,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:09,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100282464] [2019-11-27 22:36:09,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:09,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:09,134 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-11-27 22:36:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:09,375 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-11-27 22:36:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:09,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-11-27 22:36:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:09,382 INFO L225 Difference]: With dead ends: 3921 [2019-11-27 22:36:09,382 INFO L226 Difference]: Without dead ends: 1981 [2019-11-27 22:36:09,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-11-27 22:36:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-11-27 22:36:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-27 22:36:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-11-27 22:36:09,482 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-11-27 22:36:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:09,484 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-11-27 22:36:09,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-11-27 22:36:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-11-27 22:36:09,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:09,496 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2019-11-27 22:36:09,496 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:09,497 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-11-27 22:36:09,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:09,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209410585] [2019-11-27 22:36:09,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-27 22:36:09,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209410585] [2019-11-27 22:36:09,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:09,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:09,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103762318] [2019-11-27 22:36:09,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:09,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:09,935 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-11-27 22:36:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:10,100 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-11-27 22:36:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:10,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-11-27 22:36:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:10,105 INFO L225 Difference]: With dead ends: 2519 [2019-11-27 22:36:10,105 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:10,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:10,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-11-27 22:36:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:10,110 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:10,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:10,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:10,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:10,731 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-11-27 22:36:11,067 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-11-27 22:36:11,835 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:12,308 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-27 22:36:12,682 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:12,985 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-27 22:36:13,294 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-27 22:36:13,850 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:14,622 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-27 22:36:15,032 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-27 22:36:15,730 WARN L192 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-27 22:36:16,086 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:16,444 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-11-27 22:36:16,847 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-27 22:36:17,288 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-27 22:36:17,745 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:18,160 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-27 22:36:18,515 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:18,937 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:19,361 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:36:19,770 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-27 22:36:20,176 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-27 22:36:20,180 INFO L249 CegarLoopResult]: At program point L597(lines 97 598) the Hoare annotation is: true [2019-11-27 22:36:20,180 INFO L246 CegarLoopResult]: For program point L531(lines 531 533) no Hoare annotation was computed. [2019-11-27 22:36:20,180 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-27 22:36:20,180 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-27 22:36:20,180 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-27 22:36:20,181 INFO L242 CegarLoopResult]: At program point L201(lines 197 545) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (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 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (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 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-27 22:36:20,181 INFO L242 CegarLoopResult]: At program point L102(lines 101 577) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (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 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (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 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-27 22:36:20,182 INFO L246 CegarLoopResult]: For program point L203(lines 203 543) no Hoare annotation was computed. [2019-11-27 22:36:20,182 INFO L246 CegarLoopResult]: For program point L170(lines 170 554) no Hoare annotation was computed. [2019-11-27 22:36:20,183 INFO L246 CegarLoopResult]: For program point L137(lines 137 565) no Hoare annotation was computed. [2019-11-27 22:36:20,183 INFO L246 CegarLoopResult]: For program point L104(lines 104 576) no Hoare annotation was computed. [2019-11-27 22:36:20,183 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-27 22:36:20,183 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-27 22:36:20,184 INFO L242 CegarLoopResult]: At program point L204(lines 203 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:36:20,184 INFO L242 CegarLoopResult]: At program point L171(lines 167 555) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (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 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (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 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse7 .cse10 .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-27 22:36:20,185 INFO L242 CegarLoopResult]: At program point L138(lines 134 566) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,185 INFO L246 CegarLoopResult]: For program point L602(lines 602 604) no Hoare annotation was computed. [2019-11-27 22:36:20,185 INFO L246 CegarLoopResult]: For program point L602-2(lines 602 604) no Hoare annotation was computed. [2019-11-27 22:36:20,185 INFO L246 CegarLoopResult]: For program point L503(lines 503 506) no Hoare annotation was computed. [2019-11-27 22:36:20,185 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-27 22:36:20,186 INFO L242 CegarLoopResult]: At program point L206(lines 205 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:36:20,186 INFO L246 CegarLoopResult]: For program point L173(lines 173 553) no Hoare annotation was computed. [2019-11-27 22:36:20,186 INFO L246 CegarLoopResult]: For program point L140(lines 140 564) no Hoare annotation was computed. [2019-11-27 22:36:20,186 INFO L246 CegarLoopResult]: For program point L107(lines 107 575) no Hoare annotation was computed. [2019-11-27 22:36:20,186 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-27 22:36:20,187 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 540) no Hoare annotation was computed. [2019-11-27 22:36:20,187 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-27 22:36:20,187 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-27 22:36:20,187 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-27 22:36:20,187 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-27 22:36:20,187 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-27 22:36:20,188 INFO L246 CegarLoopResult]: For program point L176(lines 176 552) no Hoare annotation was computed. [2019-11-27 22:36:20,188 INFO L246 CegarLoopResult]: For program point L143(lines 143 563) no Hoare annotation was computed. [2019-11-27 22:36:20,188 INFO L246 CegarLoopResult]: For program point L110(lines 110 574) no Hoare annotation was computed. [2019-11-27 22:36:20,188 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-27 22:36:20,188 INFO L246 CegarLoopResult]: For program point L474-2(lines 207 540) no Hoare annotation was computed. [2019-11-27 22:36:20,189 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-27 22:36:20,189 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-27 22:36:20,189 INFO L242 CegarLoopResult]: At program point L210(lines 104 576) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (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 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-11-27 22:36:20,190 INFO L242 CegarLoopResult]: At program point L177(lines 173 553) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,190 INFO L242 CegarLoopResult]: At program point L144(lines 140 564) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,190 INFO L249 CegarLoopResult]: At program point L607(lines 10 609) the Hoare annotation is: true [2019-11-27 22:36:20,190 INFO L242 CegarLoopResult]: At program point L541(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-11-27 22:36:20,191 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-27 22:36:20,191 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-27 22:36:20,191 INFO L246 CegarLoopResult]: For program point L179(lines 179 551) no Hoare annotation was computed. [2019-11-27 22:36:20,191 INFO L246 CegarLoopResult]: For program point L146(lines 146 562) no Hoare annotation was computed. [2019-11-27 22:36:20,191 INFO L246 CegarLoopResult]: For program point L113(lines 113 573) no Hoare annotation was computed. [2019-11-27 22:36:20,192 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-27 22:36:20,192 INFO L246 CegarLoopResult]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-27 22:36:20,192 INFO L246 CegarLoopResult]: For program point L578(lines 578 594) no Hoare annotation was computed. [2019-11-27 22:36:20,192 INFO L242 CegarLoopResult]: At program point L512(lines 71 608) the Hoare annotation is: false [2019-11-27 22:36:20,192 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-27 22:36:20,192 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-27 22:36:20,193 INFO L246 CegarLoopResult]: For program point L182(lines 182 550) no Hoare annotation was computed. [2019-11-27 22:36:20,193 INFO L246 CegarLoopResult]: For program point L149(lines 149 561) no Hoare annotation was computed. [2019-11-27 22:36:20,193 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-27 22:36:20,193 INFO L246 CegarLoopResult]: For program point L116(lines 116 572) no Hoare annotation was computed. [2019-11-27 22:36:20,193 INFO L246 CegarLoopResult]: For program point L579(lines 579 593) no Hoare annotation was computed. [2019-11-27 22:36:20,193 INFO L246 CegarLoopResult]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-11-27 22:36:20,194 INFO L246 CegarLoopResult]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-11-27 22:36:20,194 INFO L242 CegarLoopResult]: At program point L183(lines 179 551) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,194 INFO L242 CegarLoopResult]: At program point L150(lines 146 562) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,195 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-27 22:36:20,195 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-27 22:36:20,195 INFO L246 CegarLoopResult]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-11-27 22:36:20,195 INFO L246 CegarLoopResult]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-27 22:36:20,195 INFO L246 CegarLoopResult]: For program point L580-2(lines 579 593) no Hoare annotation was computed. [2019-11-27 22:36:20,195 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-27 22:36:20,196 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,196 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:20,196 INFO L246 CegarLoopResult]: For program point L185(lines 185 549) no Hoare annotation was computed. [2019-11-27 22:36:20,196 INFO L246 CegarLoopResult]: For program point L152(lines 152 560) no Hoare annotation was computed. [2019-11-27 22:36:20,196 INFO L246 CegarLoopResult]: For program point L119(lines 119 571) no Hoare annotation was computed. [2019-11-27 22:36:20,197 INFO L246 CegarLoopResult]: For program point L582(lines 582 584) no Hoare annotation was computed. [2019-11-27 22:36:20,197 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-27 22:36:20,197 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,198 INFO L242 CegarLoopResult]: At program point L120(lines 116 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (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 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse10 .cse7 .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-27 22:36:20,198 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-27 22:36:20,198 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-27 22:36:20,198 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-27 22:36:20,199 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 540) no Hoare annotation was computed. [2019-11-27 22:36:20,199 INFO L246 CegarLoopResult]: For program point L518(lines 518 522) no Hoare annotation was computed. [2019-11-27 22:36:20,199 INFO L246 CegarLoopResult]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2019-11-27 22:36:20,199 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-27 22:36:20,199 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 540) no Hoare annotation was computed. [2019-11-27 22:36:20,199 INFO L246 CegarLoopResult]: For program point L188(lines 188 548) no Hoare annotation was computed. [2019-11-27 22:36:20,200 INFO L246 CegarLoopResult]: For program point L155(lines 155 559) no Hoare annotation was computed. [2019-11-27 22:36:20,200 INFO L246 CegarLoopResult]: For program point L122(lines 122 570) no Hoare annotation was computed. [2019-11-27 22:36:20,200 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-27 22:36:20,200 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 608) no Hoare annotation was computed. [2019-11-27 22:36:20,200 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-27 22:36:20,201 INFO L242 CegarLoopResult]: At program point L189(lines 185 549) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21))) [2019-11-27 22:36:20,201 INFO L242 CegarLoopResult]: At program point L156(lines 152 560) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,202 INFO L242 CegarLoopResult]: At program point L123(lines 122 570) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (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 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (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 8480))) [2019-11-27 22:36:20,202 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-27 22:36:20,202 INFO L249 CegarLoopResult]: At program point L619(lines 610 621) the Hoare annotation is: true [2019-11-27 22:36:20,202 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-27 22:36:20,202 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:20,202 INFO L246 CegarLoopResult]: For program point L587(lines 587 591) no Hoare annotation was computed. [2019-11-27 22:36:20,203 INFO L246 CegarLoopResult]: For program point L191(lines 191 547) no Hoare annotation was computed. [2019-11-27 22:36:20,203 INFO L246 CegarLoopResult]: For program point L158(lines 158 558) no Hoare annotation was computed. [2019-11-27 22:36:20,203 INFO L246 CegarLoopResult]: For program point L125(lines 125 569) no Hoare annotation was computed. [2019-11-27 22:36:20,203 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-27 22:36:20,203 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-27 22:36:20,203 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-27 22:36:20,204 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 540) no Hoare annotation was computed. [2019-11-27 22:36:20,204 INFO L246 CegarLoopResult]: For program point L490(lines 490 493) no Hoare annotation was computed. [2019-11-27 22:36:20,204 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-27 22:36:20,204 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-27 22:36:20,204 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:20,204 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-27 22:36:20,205 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-27 22:36:20,205 INFO L246 CegarLoopResult]: For program point L194(lines 194 546) no Hoare annotation was computed. [2019-11-27 22:36:20,205 INFO L246 CegarLoopResult]: For program point L161(lines 161 557) no Hoare annotation was computed. [2019-11-27 22:36:20,205 INFO L246 CegarLoopResult]: For program point L128(lines 128 568) no Hoare annotation was computed. [2019-11-27 22:36:20,205 INFO L242 CegarLoopResult]: At program point L195(lines 191 547) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,206 INFO L242 CegarLoopResult]: At program point L162(lines 158 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,206 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-27 22:36:20,206 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-27 22:36:20,206 INFO L246 CegarLoopResult]: For program point L197(lines 197 545) no Hoare annotation was computed. [2019-11-27 22:36:20,206 INFO L246 CegarLoopResult]: For program point L164(lines 164 556) no Hoare annotation was computed. [2019-11-27 22:36:20,207 INFO L246 CegarLoopResult]: For program point L131(lines 131 567) no Hoare annotation was computed. [2019-11-27 22:36:20,207 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-11-27 22:36:20,207 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-27 22:36:20,207 INFO L246 CegarLoopResult]: For program point L528(lines 528 534) no Hoare annotation was computed. [2019-11-27 22:36:20,208 INFO L246 CegarLoopResult]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-27 22:36:20,208 INFO L246 CegarLoopResult]: For program point L528-1(lines 528 534) no Hoare annotation was computed. [2019-11-27 22:36:20,208 INFO L246 CegarLoopResult]: For program point L495-2(lines 207 540) no Hoare annotation was computed. [2019-11-27 22:36:20,208 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,208 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-27 22:36:20,209 INFO L242 CegarLoopResult]: At program point L165(lines 164 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (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 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 .cse11 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-27 22:36:20,209 INFO L242 CegarLoopResult]: At program point L132(lines 125 569) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:36:20,210 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-27 22:36:20,210 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-27 22:36:20,210 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-27 22:36:20,210 INFO L246 CegarLoopResult]: For program point L200(lines 200 544) no Hoare annotation was computed. [2019-11-27 22:36:20,210 INFO L246 CegarLoopResult]: For program point L167(lines 167 555) no Hoare annotation was computed. [2019-11-27 22:36:20,210 INFO L246 CegarLoopResult]: For program point L134(lines 134 566) no Hoare annotation was computed. [2019-11-27 22:36:20,211 INFO L246 CegarLoopResult]: For program point L101(lines 101 577) no Hoare annotation was computed. [2019-11-27 22:36:20,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:20 BoogieIcfgContainer [2019-11-27 22:36:20,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:20,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:20,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:20,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:20,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:53" (3/4) ... [2019-11-27 22:36:20,267 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:20,286 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:36:20,287 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:20,406 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:20,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:20,408 INFO L168 Benchmark]: Toolchain (without parser) took 28889.69 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 909.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:20,409 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:36:20,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:20,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:36:20,410 INFO L168 Benchmark]: Boogie Preprocessor took 69.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:20,410 INFO L168 Benchmark]: RCFGBuilder took 847.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:20,411 INFO L168 Benchmark]: TraceAbstraction took 27115.27 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 979.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-27 22:36:20,411 INFO L168 Benchmark]: Witness Printer took 145.09 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:20,413 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.32 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 628.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 847.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27115.27 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 979.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 145.09 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 16.8s, OverallIterations: 36, TraceHistogramMax: 25, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, HoareTripleCheckerStatistics: 5516 SDtfs, 4845 SDslu, 1841 SDs, 0 SdLazy, 3378 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1317 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2988occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 1659 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 207 NumberOfFragments, 3512 HoareAnnotationTreeSize, 28 FomulaSimplifications, 29359 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7815 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 9347 NumberOfCodeBlocks, 9347 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9308 ConstructedInterpolants, 0 QuantifiedInterpolants, 4566453 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 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...