./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/openssl-simplified/s3_srvr_4.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a02d09c3bd79dd383aa53724ac7940e13c97792 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:38:49,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:38:49,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:38:49,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:38:49,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:38:49,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:38:49,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:38:49,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:38:49,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:38:49,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:38:49,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:38:49,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:38:49,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:38:49,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:38:49,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:38:49,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:38:49,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:38:49,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:38:49,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:38:49,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:38:49,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:38:49,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:38:49,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:38:49,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:38:49,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:38:49,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:38:49,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:38:49,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:38:49,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:38:49,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:38:49,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:38:49,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:38:49,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:38:49,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:38:49,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:38:49,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:38:49,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:38:49,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:38:49,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:38:49,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:38:49,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:38:49,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:38:49,452 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:38:49,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:38:49,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:38:49,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:38:49,456 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:38:49,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:38:49,457 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:38:49,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:38:49,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:38:49,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:38:49,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:38:49,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:38:49,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:38:49,458 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:38:49,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:38:49,458 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:38:49,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:38:49,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:38:49,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:38:49,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:38:49,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:38:49,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:38:49,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:38:49,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:38:49,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:38:49,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:38:49,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:38:49,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:38:49,462 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:38:49,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 7a02d09c3bd79dd383aa53724ac7940e13c97792 [2020-10-25 19:38:49,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:38:49,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:38:49,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:38:49,912 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:38:49,913 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:38:49,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2020-10-25 19:38:49,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbac5fcda/7ed76d50852847528b5c198939f3fd97/FLAG62a24de2a [2020-10-25 19:38:50,635 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:38:50,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2020-10-25 19:38:50,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbac5fcda/7ed76d50852847528b5c198939f3fd97/FLAG62a24de2a [2020-10-25 19:38:50,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbac5fcda/7ed76d50852847528b5c198939f3fd97 [2020-10-25 19:38:50,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:38:50,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:38:50,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:38:50,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:38:50,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:38:50,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:38:50" (1/1) ... [2020-10-25 19:38:50,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347a35b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:50, skipping insertion in model container [2020-10-25 19:38:51,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:38:50" (1/1) ... [2020-10-25 19:38:51,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:38:51,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:38:51,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:38:51,292 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:38:51,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:38:51,441 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:38:51,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51 WrapperNode [2020-10-25 19:38:51,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:38:51,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:38:51,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:38:51,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:38:51,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:38:51,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:38:51,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:38:51,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:38:51,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (1/1) ... [2020-10-25 19:38:51,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:38:51,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:38:51,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:38:51,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:38:51,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (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 [2020-10-25 19:38:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:38:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:38:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:38:51,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:38:51,984 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:38:52,543 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-10-25 19:38:52,543 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-10-25 19:38:52,553 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:38:52,553 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:38:52,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:38:52 BoogieIcfgContainer [2020-10-25 19:38:52,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:38:52,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:38:52,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:38:52,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:38:52,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:38:50" (1/3) ... [2020-10-25 19:38:52,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5162f891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:38:52, skipping insertion in model container [2020-10-25 19:38:52,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:51" (2/3) ... [2020-10-25 19:38:52,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5162f891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:38:52, skipping insertion in model container [2020-10-25 19:38:52,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:38:52" (3/3) ... [2020-10-25 19:38:52,565 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2020-10-25 19:38:52,577 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:38:52,583 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:38:52,596 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:38:52,623 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:38:52,623 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:38:52,624 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:38:52,624 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:38:52,624 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:38:52,624 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:38:52,625 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:38:52,625 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:38:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-10-25 19:38:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-25 19:38:52,657 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:52,658 INFO L422 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] [2020-10-25 19:38:52,658 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2020-10-25 19:38:52,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:52,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663760525] [2020-10-25 19:38:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:52,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663760525] [2020-10-25 19:38:52,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:52,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:52,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800133196] [2020-10-25 19:38:52,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:52,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:52,980 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2020-10-25 19:38:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:53,345 INFO L93 Difference]: Finished difference Result 329 states and 565 transitions. [2020-10-25 19:38:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:53,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-10-25 19:38:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:53,362 INFO L225 Difference]: With dead ends: 329 [2020-10-25 19:38:53,362 INFO L226 Difference]: Without dead ends: 175 [2020-10-25 19:38:53,366 INFO L677 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 [2020-10-25 19:38:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-25 19:38:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2020-10-25 19:38:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-25 19:38:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2020-10-25 19:38:53,469 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2020-10-25 19:38:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:53,473 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2020-10-25 19:38:53,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2020-10-25 19:38:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:38:53,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:53,479 INFO L422 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, 1] [2020-10-25 19:38:53,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:38:53,481 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2020-10-25 19:38:53,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:53,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083196285] [2020-10-25 19:38:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:53,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083196285] [2020-10-25 19:38:53,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:53,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:53,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709949646] [2020-10-25 19:38:53,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:53,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:53,610 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand 3 states. [2020-10-25 19:38:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:53,893 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2020-10-25 19:38:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:53,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-25 19:38:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:53,898 INFO L225 Difference]: With dead ends: 380 [2020-10-25 19:38:53,898 INFO L226 Difference]: Without dead ends: 216 [2020-10-25 19:38:53,900 INFO L677 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 [2020-10-25 19:38:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-25 19:38:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2020-10-25 19:38:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-25 19:38:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2020-10-25 19:38:53,929 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2020-10-25 19:38:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:53,929 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2020-10-25 19:38:53,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2020-10-25 19:38:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-25 19:38:53,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:53,938 INFO L422 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, 1] [2020-10-25 19:38:53,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:38:53,941 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2020-10-25 19:38:53,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:53,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754359979] [2020-10-25 19:38:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:54,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754359979] [2020-10-25 19:38:54,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:54,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:54,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998957494] [2020-10-25 19:38:54,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:54,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:54,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:54,074 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand 3 states. [2020-10-25 19:38:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:54,299 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2020-10-25 19:38:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:54,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-10-25 19:38:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:54,302 INFO L225 Difference]: With dead ends: 445 [2020-10-25 19:38:54,303 INFO L226 Difference]: Without dead ends: 242 [2020-10-25 19:38:54,304 INFO L677 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 [2020-10-25 19:38:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-10-25 19:38:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-10-25 19:38:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-25 19:38:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2020-10-25 19:38:54,326 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2020-10-25 19:38:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:54,326 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2020-10-25 19:38:54,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2020-10-25 19:38:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:38:54,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:54,331 INFO L422 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, 1] [2020-10-25 19:38:54,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:38:54,331 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2020-10-25 19:38:54,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:54,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827481970] [2020-10-25 19:38:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:38:54,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827481970] [2020-10-25 19:38:54,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:54,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:54,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820096331] [2020-10-25 19:38:54,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:54,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:54,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:54,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:54,448 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand 3 states. [2020-10-25 19:38:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:54,647 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2020-10-25 19:38:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:54,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-10-25 19:38:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:54,650 INFO L225 Difference]: With dead ends: 493 [2020-10-25 19:38:54,650 INFO L226 Difference]: Without dead ends: 259 [2020-10-25 19:38:54,652 INFO L677 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 [2020-10-25 19:38:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-10-25 19:38:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2020-10-25 19:38:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-25 19:38:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2020-10-25 19:38:54,671 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2020-10-25 19:38:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:54,671 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2020-10-25 19:38:54,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2020-10-25 19:38:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:38:54,674 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:54,675 INFO L422 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, 1] [2020-10-25 19:38:54,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:38:54,675 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2020-10-25 19:38:54,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:54,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284084977] [2020-10-25 19:38:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:54,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284084977] [2020-10-25 19:38:54,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:54,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:54,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910527613] [2020-10-25 19:38:54,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:54,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:54,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:54,799 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand 3 states. [2020-10-25 19:38:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,062 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2020-10-25 19:38:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-10-25 19:38:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,065 INFO L225 Difference]: With dead ends: 553 [2020-10-25 19:38:55,065 INFO L226 Difference]: Without dead ends: 304 [2020-10-25 19:38:55,066 INFO L677 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 [2020-10-25 19:38:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-25 19:38:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2020-10-25 19:38:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-25 19:38:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2020-10-25 19:38:55,085 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2020-10-25 19:38:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,086 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2020-10-25 19:38:55,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2020-10-25 19:38:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-25 19:38:55,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,089 INFO L422 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, 1] [2020-10-25 19:38:55,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:38:55,089 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2020-10-25 19:38:55,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114262531] [2020-10-25 19:38:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:38:55,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114262531] [2020-10-25 19:38:55,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061275654] [2020-10-25 19:38:55,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,144 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand 3 states. [2020-10-25 19:38:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,297 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2020-10-25 19:38:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-25 19:38:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,300 INFO L225 Difference]: With dead ends: 592 [2020-10-25 19:38:55,300 INFO L226 Difference]: Without dead ends: 301 [2020-10-25 19:38:55,301 INFO L677 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 [2020-10-25 19:38:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-10-25 19:38:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2020-10-25 19:38:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-25 19:38:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2020-10-25 19:38:55,317 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2020-10-25 19:38:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,317 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2020-10-25 19:38:55,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2020-10-25 19:38:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-25 19:38:55,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,320 INFO L422 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, 1] [2020-10-25 19:38:55,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:38:55,321 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2020-10-25 19:38:55,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000551475] [2020-10-25 19:38:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:55,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000551475] [2020-10-25 19:38:55,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954190151] [2020-10-25 19:38:55,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,380 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand 3 states. [2020-10-25 19:38:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,624 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2020-10-25 19:38:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-25 19:38:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,630 INFO L225 Difference]: With dead ends: 595 [2020-10-25 19:38:55,630 INFO L226 Difference]: Without dead ends: 302 [2020-10-25 19:38:55,631 INFO L677 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 [2020-10-25 19:38:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-25 19:38:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2020-10-25 19:38:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-25 19:38:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2020-10-25 19:38:55,644 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2020-10-25 19:38:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,644 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2020-10-25 19:38:55,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2020-10-25 19:38:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-25 19:38:55,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,647 INFO L422 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, 1] [2020-10-25 19:38:55,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:38:55,647 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2020-10-25 19:38:55,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104326741] [2020-10-25 19:38:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-25 19:38:55,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104326741] [2020-10-25 19:38:55,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388241438] [2020-10-25 19:38:55,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,727 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand 3 states. [2020-10-25 19:38:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,877 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2020-10-25 19:38:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-10-25 19:38:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,880 INFO L225 Difference]: With dead ends: 595 [2020-10-25 19:38:55,880 INFO L226 Difference]: Without dead ends: 306 [2020-10-25 19:38:55,881 INFO L677 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 [2020-10-25 19:38:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-10-25 19:38:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-10-25 19:38:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-10-25 19:38:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2020-10-25 19:38:55,894 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2020-10-25 19:38:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,895 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2020-10-25 19:38:55,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2020-10-25 19:38:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:38:55,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,897 INFO L422 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, 1] [2020-10-25 19:38:55,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:38:55,897 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2020-10-25 19:38:55,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806159236] [2020-10-25 19:38:55,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:38:55,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806159236] [2020-10-25 19:38:55,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32174920] [2020-10-25 19:38:55,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,948 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 3 states. [2020-10-25 19:38:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:56,154 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2020-10-25 19:38:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:56,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-10-25 19:38:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:56,157 INFO L225 Difference]: With dead ends: 635 [2020-10-25 19:38:56,158 INFO L226 Difference]: Without dead ends: 337 [2020-10-25 19:38:56,159 INFO L677 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 [2020-10-25 19:38:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-10-25 19:38:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2020-10-25 19:38:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-10-25 19:38:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2020-10-25 19:38:56,174 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2020-10-25 19:38:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:56,175 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2020-10-25 19:38:56,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2020-10-25 19:38:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:38:56,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:56,177 INFO L422 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, 1] [2020-10-25 19:38:56,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:38:56,178 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2020-10-25 19:38:56,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:56,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096499433] [2020-10-25 19:38:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:38:56,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096499433] [2020-10-25 19:38:56,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:56,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:56,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669628418] [2020-10-25 19:38:56,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:56,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:56,256 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 3 states. [2020-10-25 19:38:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:56,457 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2020-10-25 19:38:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:56,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-10-25 19:38:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:56,462 INFO L225 Difference]: With dead ends: 664 [2020-10-25 19:38:56,462 INFO L226 Difference]: Without dead ends: 337 [2020-10-25 19:38:56,464 INFO L677 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 [2020-10-25 19:38:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-10-25 19:38:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2020-10-25 19:38:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-10-25 19:38:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2020-10-25 19:38:56,484 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2020-10-25 19:38:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:56,485 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2020-10-25 19:38:56,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2020-10-25 19:38:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:38:56,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:56,488 INFO L422 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, 1] [2020-10-25 19:38:56,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:38:56,488 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2020-10-25 19:38:56,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:56,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853621497] [2020-10-25 19:38:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:38:56,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853621497] [2020-10-25 19:38:56,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:56,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:56,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258538296] [2020-10-25 19:38:56,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:56,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:56,587 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand 3 states. [2020-10-25 19:38:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:56,789 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2020-10-25 19:38:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:56,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-10-25 19:38:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:56,793 INFO L225 Difference]: With dead ends: 697 [2020-10-25 19:38:56,793 INFO L226 Difference]: Without dead ends: 370 [2020-10-25 19:38:56,795 INFO L677 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 [2020-10-25 19:38:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-25 19:38:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2020-10-25 19:38:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-10-25 19:38:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2020-10-25 19:38:56,812 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2020-10-25 19:38:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:56,813 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2020-10-25 19:38:56,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2020-10-25 19:38:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-25 19:38:56,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:56,815 INFO L422 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, 1] [2020-10-25 19:38:56,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:38:56,815 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2020-10-25 19:38:56,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:56,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408645513] [2020-10-25 19:38:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 19:38:56,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408645513] [2020-10-25 19:38:56,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:56,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:56,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835838881] [2020-10-25 19:38:56,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:56,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:56,886 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 3 states. [2020-10-25 19:38:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:57,094 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2020-10-25 19:38:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:57,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-10-25 19:38:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:57,098 INFO L225 Difference]: With dead ends: 724 [2020-10-25 19:38:57,098 INFO L226 Difference]: Without dead ends: 370 [2020-10-25 19:38:57,099 INFO L677 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 [2020-10-25 19:38:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-25 19:38:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2020-10-25 19:38:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-10-25 19:38:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2020-10-25 19:38:57,118 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2020-10-25 19:38:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:57,119 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2020-10-25 19:38:57,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2020-10-25 19:38:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-25 19:38:57,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:57,124 INFO L422 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, 1] [2020-10-25 19:38:57,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:38:57,124 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2020-10-25 19:38:57,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:57,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954177783] [2020-10-25 19:38:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:38:57,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954177783] [2020-10-25 19:38:57,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:57,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:57,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777814091] [2020-10-25 19:38:57,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:57,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:57,196 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 3 states. [2020-10-25 19:38:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:57,382 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2020-10-25 19:38:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:57,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-10-25 19:38:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:57,385 INFO L225 Difference]: With dead ends: 741 [2020-10-25 19:38:57,385 INFO L226 Difference]: Without dead ends: 387 [2020-10-25 19:38:57,386 INFO L677 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 [2020-10-25 19:38:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-10-25 19:38:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2020-10-25 19:38:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-25 19:38:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2020-10-25 19:38:57,405 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2020-10-25 19:38:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:57,406 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2020-10-25 19:38:57,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2020-10-25 19:38:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:38:57,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:57,408 INFO L422 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, 1] [2020-10-25 19:38:57,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:38:57,408 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2020-10-25 19:38:57,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:57,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989098068] [2020-10-25 19:38:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:38:57,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989098068] [2020-10-25 19:38:57,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:57,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:57,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492345215] [2020-10-25 19:38:57,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:57,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:57,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:57,484 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 3 states. [2020-10-25 19:38:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:57,729 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2020-10-25 19:38:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:57,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 19:38:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:57,735 INFO L225 Difference]: With dead ends: 762 [2020-10-25 19:38:57,735 INFO L226 Difference]: Without dead ends: 387 [2020-10-25 19:38:57,738 INFO L677 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 [2020-10-25 19:38:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-10-25 19:38:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2020-10-25 19:38:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-25 19:38:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2020-10-25 19:38:57,762 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2020-10-25 19:38:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:57,763 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2020-10-25 19:38:57,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2020-10-25 19:38:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-25 19:38:57,765 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:57,765 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:57,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:38:57,766 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2020-10-25 19:38:57,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:57,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999902621] [2020-10-25 19:38:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-10-25 19:38:57,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999902621] [2020-10-25 19:38:57,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:57,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:57,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882118673] [2020-10-25 19:38:57,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:57,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:57,867 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2020-10-25 19:38:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:57,934 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2020-10-25 19:38:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:57,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-10-25 19:38:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:57,940 INFO L225 Difference]: With dead ends: 758 [2020-10-25 19:38:57,940 INFO L226 Difference]: Without dead ends: 756 [2020-10-25 19:38:57,942 INFO L677 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 [2020-10-25 19:38:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-10-25 19:38:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2020-10-25 19:38:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-10-25 19:38:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2020-10-25 19:38:57,980 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2020-10-25 19:38:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:57,981 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2020-10-25 19:38:57,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2020-10-25 19:38:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-25 19:38:57,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:57,984 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:57,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:38:57,984 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:57,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2020-10-25 19:38:57,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:57,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918188178] [2020-10-25 19:38:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:38:58,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918188178] [2020-10-25 19:38:58,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:58,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:58,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118017227] [2020-10-25 19:38:58,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:58,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:58,067 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand 3 states. [2020-10-25 19:38:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:58,143 INFO L93 Difference]: Finished difference Result 1832 states and 2900 transitions. [2020-10-25 19:38:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:58,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-10-25 19:38:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:58,151 INFO L225 Difference]: With dead ends: 1832 [2020-10-25 19:38:58,151 INFO L226 Difference]: Without dead ends: 1084 [2020-10-25 19:38:58,153 INFO L677 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 [2020-10-25 19:38:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-10-25 19:38:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2020-10-25 19:38:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2020-10-25 19:38:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1713 transitions. [2020-10-25 19:38:58,202 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1713 transitions. Word has length 122 [2020-10-25 19:38:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:58,203 INFO L481 AbstractCegarLoop]: Abstraction has 1084 states and 1713 transitions. [2020-10-25 19:38:58,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1713 transitions. [2020-10-25 19:38:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-25 19:38:58,206 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:58,207 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:58,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:38:58,207 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2020-10-25 19:38:58,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:58,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328884100] [2020-10-25 19:38:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:38:58,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328884100] [2020-10-25 19:38:58,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:58,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:58,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961570325] [2020-10-25 19:38:58,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:58,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:58,259 INFO L87 Difference]: Start difference. First operand 1084 states and 1713 transitions. Second operand 3 states. [2020-10-25 19:38:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:58,340 INFO L93 Difference]: Finished difference Result 2529 states and 4000 transitions. [2020-10-25 19:38:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:58,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-10-25 19:38:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:58,348 INFO L225 Difference]: With dead ends: 2529 [2020-10-25 19:38:58,348 INFO L226 Difference]: Without dead ends: 1453 [2020-10-25 19:38:58,351 INFO L677 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 [2020-10-25 19:38:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-10-25 19:38:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2020-10-25 19:38:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2020-10-25 19:38:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2295 transitions. [2020-10-25 19:38:58,425 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2295 transitions. Word has length 122 [2020-10-25 19:38:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:58,426 INFO L481 AbstractCegarLoop]: Abstraction has 1453 states and 2295 transitions. [2020-10-25 19:38:58,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2295 transitions. [2020-10-25 19:38:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-25 19:38:58,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:58,430 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:58,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 19:38:58,430 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2020-10-25 19:38:58,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:58,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687089040] [2020-10-25 19:38:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-25 19:38:58,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687089040] [2020-10-25 19:38:58,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:58,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:58,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322284714] [2020-10-25 19:38:58,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:58,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:58,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:58,483 INFO L87 Difference]: Start difference. First operand 1453 states and 2295 transitions. Second operand 3 states. [2020-10-25 19:38:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:58,572 INFO L93 Difference]: Finished difference Result 3249 states and 5133 transitions. [2020-10-25 19:38:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:58,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-10-25 19:38:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:58,583 INFO L225 Difference]: With dead ends: 3249 [2020-10-25 19:38:58,583 INFO L226 Difference]: Without dead ends: 1804 [2020-10-25 19:38:58,586 INFO L677 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 [2020-10-25 19:38:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2020-10-25 19:38:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2020-10-25 19:38:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-10-25 19:38:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2846 transitions. [2020-10-25 19:38:58,681 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2846 transitions. Word has length 122 [2020-10-25 19:38:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:58,681 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2846 transitions. [2020-10-25 19:38:58,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2846 transitions. [2020-10-25 19:38:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-10-25 19:38:58,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:58,689 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:58,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 19:38:58,689 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2020-10-25 19:38:58,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:58,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108368517] [2020-10-25 19:38:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-25 19:38:58,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108368517] [2020-10-25 19:38:58,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:58,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:58,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646598982] [2020-10-25 19:38:58,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:58,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:58,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:58,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:58,781 INFO L87 Difference]: Start difference. First operand 1804 states and 2846 transitions. Second operand 3 states. [2020-10-25 19:38:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:59,091 INFO L93 Difference]: Finished difference Result 3650 states and 5740 transitions. [2020-10-25 19:38:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:59,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2020-10-25 19:38:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:59,103 INFO L225 Difference]: With dead ends: 3650 [2020-10-25 19:38:59,103 INFO L226 Difference]: Without dead ends: 1854 [2020-10-25 19:38:59,106 INFO L677 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 [2020-10-25 19:38:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2020-10-25 19:38:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2020-10-25 19:38:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-10-25 19:38:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2774 transitions. [2020-10-25 19:38:59,195 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2774 transitions. Word has length 199 [2020-10-25 19:38:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:59,196 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2774 transitions. [2020-10-25 19:38:59,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2774 transitions. [2020-10-25 19:38:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-10-25 19:38:59,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:59,202 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:59,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 19:38:59,202 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2020-10-25 19:38:59,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:59,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528841104] [2020-10-25 19:38:59,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-10-25 19:38:59,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528841104] [2020-10-25 19:38:59,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:59,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:59,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822321211] [2020-10-25 19:38:59,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:59,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:59,299 INFO L87 Difference]: Start difference. First operand 1804 states and 2774 transitions. Second operand 3 states. [2020-10-25 19:38:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:59,569 INFO L93 Difference]: Finished difference Result 3667 states and 5613 transitions. [2020-10-25 19:38:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:59,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-10-25 19:38:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:59,580 INFO L225 Difference]: With dead ends: 3667 [2020-10-25 19:38:59,580 INFO L226 Difference]: Without dead ends: 1871 [2020-10-25 19:38:59,583 INFO L677 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 [2020-10-25 19:38:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2020-10-25 19:38:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2020-10-25 19:38:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-10-25 19:38:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2698 transitions. [2020-10-25 19:38:59,657 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2698 transitions. Word has length 213 [2020-10-25 19:38:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:59,658 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2698 transitions. [2020-10-25 19:38:59,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2698 transitions. [2020-10-25 19:38:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-10-25 19:38:59,663 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:59,664 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:59,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:38:59,664 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:59,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2020-10-25 19:38:59,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:59,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040965252] [2020-10-25 19:38:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-25 19:38:59,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040965252] [2020-10-25 19:38:59,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332642033] [2020-10-25 19:38:59,803 INFO L95 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 [2020-10-25 19:38:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:59,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:38:59,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:39:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-25 19:39:00,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:39:00,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-25 19:39:00,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541292793] [2020-10-25 19:39:00,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:39:00,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:39:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:39:00,072 INFO L87 Difference]: Start difference. First operand 1804 states and 2698 transitions. Second operand 4 states. [2020-10-25 19:39:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:00,710 INFO L93 Difference]: Finished difference Result 4265 states and 6329 transitions. [2020-10-25 19:39:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 19:39:00,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2020-10-25 19:39:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:00,724 INFO L225 Difference]: With dead ends: 4265 [2020-10-25 19:39:00,724 INFO L226 Difference]: Without dead ends: 2436 [2020-10-25 19:39:00,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:39:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2020-10-25 19:39:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2020-10-25 19:39:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2020-10-25 19:39:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2362 transitions. [2020-10-25 19:39:00,822 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2362 transitions. Word has length 232 [2020-10-25 19:39:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:00,823 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2362 transitions. [2020-10-25 19:39:00,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:39:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2362 transitions. [2020-10-25 19:39:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-10-25 19:39:00,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:00,830 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-25 19:39:01,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-10-25 19:39:01,044 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2020-10-25 19:39:01,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:01,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630037719] [2020-10-25 19:39:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-10-25 19:39:01,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630037719] [2020-10-25 19:39:01,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:01,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:01,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868122834] [2020-10-25 19:39:01,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:01,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:01,196 INFO L87 Difference]: Start difference. First operand 1604 states and 2362 transitions. Second operand 3 states. [2020-10-25 19:39:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:01,443 INFO L93 Difference]: Finished difference Result 3395 states and 5017 transitions. [2020-10-25 19:39:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:01,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2020-10-25 19:39:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:01,453 INFO L225 Difference]: With dead ends: 3395 [2020-10-25 19:39:01,453 INFO L226 Difference]: Without dead ends: 1679 [2020-10-25 19:39:01,456 INFO L677 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 [2020-10-25 19:39:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2020-10-25 19:39:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2020-10-25 19:39:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2020-10-25 19:39:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2427 transitions. [2020-10-25 19:39:01,547 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2427 transitions. Word has length 241 [2020-10-25 19:39:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:01,548 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 2427 transitions. [2020-10-25 19:39:01,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2427 transitions. [2020-10-25 19:39:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-10-25 19:39:01,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:01,554 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:01,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 19:39:01,555 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2020-10-25 19:39:01,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:01,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326880708] [2020-10-25 19:39:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-10-25 19:39:01,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326880708] [2020-10-25 19:39:01,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420436534] [2020-10-25 19:39:01,698 INFO L95 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 [2020-10-25 19:39:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:01,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:39:01,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:39:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-10-25 19:39:01,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:39:01,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-25 19:39:01,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998696567] [2020-10-25 19:39:01,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:39:01,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:39:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:39:01,993 INFO L87 Difference]: Start difference. First operand 1679 states and 2427 transitions. Second operand 4 states. [2020-10-25 19:39:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:02,521 INFO L93 Difference]: Finished difference Result 5320 states and 7733 transitions. [2020-10-25 19:39:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 19:39:02,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2020-10-25 19:39:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:02,540 INFO L225 Difference]: With dead ends: 5320 [2020-10-25 19:39:02,540 INFO L226 Difference]: Without dead ends: 3649 [2020-10-25 19:39:02,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:39:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2020-10-25 19:39:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2004. [2020-10-25 19:39:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2020-10-25 19:39:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2729 transitions. [2020-10-25 19:39:02,651 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2729 transitions. Word has length 253 [2020-10-25 19:39:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:02,652 INFO L481 AbstractCegarLoop]: Abstraction has 2004 states and 2729 transitions. [2020-10-25 19:39:02,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:39:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2729 transitions. [2020-10-25 19:39:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-10-25 19:39:02,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:02,658 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:02,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-10-25 19:39:02,883 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2020-10-25 19:39:02,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:02,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34588144] [2020-10-25 19:39:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2020-10-25 19:39:02,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34588144] [2020-10-25 19:39:02,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:02,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:02,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574508336] [2020-10-25 19:39:02,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:02,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:02,994 INFO L87 Difference]: Start difference. First operand 2004 states and 2729 transitions. Second operand 3 states. [2020-10-25 19:39:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,125 INFO L93 Difference]: Finished difference Result 5742 states and 7864 transitions. [2020-10-25 19:39:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2020-10-25 19:39:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,144 INFO L225 Difference]: With dead ends: 5742 [2020-10-25 19:39:03,145 INFO L226 Difference]: Without dead ends: 3746 [2020-10-25 19:39:03,149 INFO L677 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 [2020-10-25 19:39:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2020-10-25 19:39:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2020-10-25 19:39:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2020-10-25 19:39:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5134 transitions. [2020-10-25 19:39:03,368 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5134 transitions. Word has length 253 [2020-10-25 19:39:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,368 INFO L481 AbstractCegarLoop]: Abstraction has 3744 states and 5134 transitions. [2020-10-25 19:39:03,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5134 transitions. [2020-10-25 19:39:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-10-25 19:39:03,379 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,379 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:03,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:39:03,380 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2020-10-25 19:39:03,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952518335] [2020-10-25 19:39:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-10-25 19:39:03,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952518335] [2020-10-25 19:39:03,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280843263] [2020-10-25 19:39:03,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,513 INFO L87 Difference]: Start difference. First operand 3744 states and 5134 transitions. Second operand 3 states. [2020-10-25 19:39:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,802 INFO L93 Difference]: Finished difference Result 7698 states and 10554 transitions. [2020-10-25 19:39:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2020-10-25 19:39:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,815 INFO L225 Difference]: With dead ends: 7698 [2020-10-25 19:39:03,816 INFO L226 Difference]: Without dead ends: 3962 [2020-10-25 19:39:03,821 INFO L677 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 [2020-10-25 19:39:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-10-25 19:39:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3744. [2020-10-25 19:39:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2020-10-25 19:39:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5030 transitions. [2020-10-25 19:39:04,017 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5030 transitions. Word has length 256 [2020-10-25 19:39:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,017 INFO L481 AbstractCegarLoop]: Abstraction has 3744 states and 5030 transitions. [2020-10-25 19:39:04,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5030 transitions. [2020-10-25 19:39:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-10-25 19:39:04,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,027 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:04,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 19:39:04,028 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2020-10-25 19:39:04,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519868487] [2020-10-25 19:39:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2020-10-25 19:39:04,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519868487] [2020-10-25 19:39:04,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874990845] [2020-10-25 19:39:04,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,148 INFO L87 Difference]: Start difference. First operand 3744 states and 5030 transitions. Second operand 3 states. [2020-10-25 19:39:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,391 INFO L93 Difference]: Finished difference Result 7612 states and 10230 transitions. [2020-10-25 19:39:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2020-10-25 19:39:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,406 INFO L225 Difference]: With dead ends: 7612 [2020-10-25 19:39:04,406 INFO L226 Difference]: Without dead ends: 3876 [2020-10-25 19:39:04,412 INFO L677 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 [2020-10-25 19:39:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2020-10-25 19:39:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3836. [2020-10-25 19:39:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2020-10-25 19:39:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5142 transitions. [2020-10-25 19:39:04,576 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5142 transitions. Word has length 290 [2020-10-25 19:39:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,576 INFO L481 AbstractCegarLoop]: Abstraction has 3836 states and 5142 transitions. [2020-10-25 19:39:04,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5142 transitions. [2020-10-25 19:39:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2020-10-25 19:39:04,587 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,587 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:04,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:39:04,588 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2020-10-25 19:39:04,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210467625] [2020-10-25 19:39:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2020-10-25 19:39:04,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210467625] [2020-10-25 19:39:04,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238985688] [2020-10-25 19:39:04,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,690 INFO L87 Difference]: Start difference. First operand 3836 states and 5142 transitions. Second operand 3 states. [2020-10-25 19:39:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,957 INFO L93 Difference]: Finished difference Result 8044 states and 10852 transitions. [2020-10-25 19:39:04,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2020-10-25 19:39:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,966 INFO L225 Difference]: With dead ends: 8044 [2020-10-25 19:39:04,966 INFO L226 Difference]: Without dead ends: 4216 [2020-10-25 19:39:04,972 INFO L677 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 [2020-10-25 19:39:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2020-10-25 19:39:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4086. [2020-10-25 19:39:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2020-10-25 19:39:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5442 transitions. [2020-10-25 19:39:05,134 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5442 transitions. Word has length 311 [2020-10-25 19:39:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,134 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 5442 transitions. [2020-10-25 19:39:05,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5442 transitions. [2020-10-25 19:39:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2020-10-25 19:39:05,146 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,146 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:05,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:39:05,147 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2020-10-25 19:39:05,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126416900] [2020-10-25 19:39:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2020-10-25 19:39:05,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126416900] [2020-10-25 19:39:05,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996308435] [2020-10-25 19:39:05,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,270 INFO L87 Difference]: Start difference. First operand 4086 states and 5442 transitions. Second operand 3 states. [2020-10-25 19:39:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,525 INFO L93 Difference]: Finished difference Result 6855 states and 9019 transitions. [2020-10-25 19:39:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2020-10-25 19:39:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,530 INFO L225 Difference]: With dead ends: 6855 [2020-10-25 19:39:05,531 INFO L226 Difference]: Without dead ends: 2133 [2020-10-25 19:39:05,537 INFO L677 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 [2020-10-25 19:39:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2020-10-25 19:39:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2020-10-25 19:39:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-10-25 19:39:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2774 transitions. [2020-10-25 19:39:05,661 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2774 transitions. Word has length 321 [2020-10-25 19:39:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,661 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2774 transitions. [2020-10-25 19:39:05,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2774 transitions. [2020-10-25 19:39:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2020-10-25 19:39:05,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,667 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:05,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 19:39:05,667 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2020-10-25 19:39:05,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523412751] [2020-10-25 19:39:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2020-10-25 19:39:05,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523412751] [2020-10-25 19:39:05,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404907670] [2020-10-25 19:39:05,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,849 INFO L87 Difference]: Start difference. First operand 2133 states and 2774 transitions. Second operand 3 states. [2020-10-25 19:39:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,081 INFO L93 Difference]: Finished difference Result 4298 states and 5601 transitions. [2020-10-25 19:39:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2020-10-25 19:39:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,087 INFO L225 Difference]: With dead ends: 4298 [2020-10-25 19:39:06,088 INFO L226 Difference]: Without dead ends: 2173 [2020-10-25 19:39:06,092 INFO L677 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 [2020-10-25 19:39:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2020-10-25 19:39:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2133. [2020-10-25 19:39:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-10-25 19:39:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2734 transitions. [2020-10-25 19:39:06,178 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2734 transitions. Word has length 337 [2020-10-25 19:39:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,178 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2734 transitions. [2020-10-25 19:39:06,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2734 transitions. [2020-10-25 19:39:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2020-10-25 19:39:06,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,185 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:06,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:39:06,185 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2020-10-25 19:39:06,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283229030] [2020-10-25 19:39:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2020-10-25 19:39:06,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283229030] [2020-10-25 19:39:06,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119485242] [2020-10-25 19:39:06,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,361 INFO L87 Difference]: Start difference. First operand 2133 states and 2734 transitions. Second operand 3 states. [2020-10-25 19:39:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,569 INFO L93 Difference]: Finished difference Result 4268 states and 5466 transitions. [2020-10-25 19:39:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2020-10-25 19:39:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,574 INFO L225 Difference]: With dead ends: 4268 [2020-10-25 19:39:06,574 INFO L226 Difference]: Without dead ends: 2143 [2020-10-25 19:39:06,577 INFO L677 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 [2020-10-25 19:39:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2020-10-25 19:39:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2133. [2020-10-25 19:39:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-10-25 19:39:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2694 transitions. [2020-10-25 19:39:06,644 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2694 transitions. Word has length 360 [2020-10-25 19:39:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,645 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2694 transitions. [2020-10-25 19:39:06,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2694 transitions. [2020-10-25 19:39:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2020-10-25 19:39:06,651 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,651 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:06,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:39:06,652 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2020-10-25 19:39:06,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362538116] [2020-10-25 19:39:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-25 19:39:06,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362538116] [2020-10-25 19:39:06,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265305764] [2020-10-25 19:39:06,823 INFO L95 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 [2020-10-25 19:39:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:39:06,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:39:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2020-10-25 19:39:07,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 19:39:07,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-25 19:39:07,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137856982] [2020-10-25 19:39:07,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:07,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:39:07,152 INFO L87 Difference]: Start difference. First operand 2133 states and 2694 transitions. Second operand 3 states. [2020-10-25 19:39:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:07,229 INFO L93 Difference]: Finished difference Result 2711 states and 3448 transitions. [2020-10-25 19:39:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:07,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2020-10-25 19:39:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:07,235 INFO L225 Difference]: With dead ends: 2711 [2020-10-25 19:39:07,236 INFO L226 Difference]: Without dead ends: 2573 [2020-10-25 19:39:07,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:39:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2020-10-25 19:39:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1997. [2020-10-25 19:39:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2020-10-25 19:39:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2540 transitions. [2020-10-25 19:39:07,305 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2540 transitions. Word has length 393 [2020-10-25 19:39:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:07,306 INFO L481 AbstractCegarLoop]: Abstraction has 1997 states and 2540 transitions. [2020-10-25 19:39:07,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2540 transitions. [2020-10-25 19:39:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2020-10-25 19:39:07,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:07,311 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:07,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:39:07,525 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2020-10-25 19:39:07,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:07,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829110158] [2020-10-25 19:39:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2020-10-25 19:39:07,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829110158] [2020-10-25 19:39:07,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248832812] [2020-10-25 19:39:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:39:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:07,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:39:07,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:39:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2020-10-25 19:39:08,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:39:08,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-25 19:39:08,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577955609] [2020-10-25 19:39:08,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:39:08,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:39:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:39:08,011 INFO L87 Difference]: Start difference. First operand 1997 states and 2540 transitions. Second operand 4 states. [2020-10-25 19:39:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:08,451 INFO L93 Difference]: Finished difference Result 5016 states and 6404 transitions. [2020-10-25 19:39:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 19:39:08,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2020-10-25 19:39:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:08,458 INFO L225 Difference]: With dead ends: 5016 [2020-10-25 19:39:08,459 INFO L226 Difference]: Without dead ends: 2985 [2020-10-25 19:39:08,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:39:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-10-25 19:39:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2157. [2020-10-25 19:39:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-25 19:39:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2760 transitions. [2020-10-25 19:39:08,552 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2760 transitions. Word has length 409 [2020-10-25 19:39:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:08,553 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 2760 transitions. [2020-10-25 19:39:08,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:39:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2760 transitions. [2020-10-25 19:39:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2020-10-25 19:39:08,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:08,558 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:08,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:39:08,771 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1865506571, now seen corresponding path program 1 times [2020-10-25 19:39:08,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:08,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425747331] [2020-10-25 19:39:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2020-10-25 19:39:09,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425747331] [2020-10-25 19:39:09,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:09,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:09,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448903889] [2020-10-25 19:39:09,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:09,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:09,064 INFO L87 Difference]: Start difference. First operand 2157 states and 2760 transitions. Second operand 3 states. [2020-10-25 19:39:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:09,324 INFO L93 Difference]: Finished difference Result 4486 states and 5763 transitions. [2020-10-25 19:39:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:09,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2020-10-25 19:39:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:09,330 INFO L225 Difference]: With dead ends: 4486 [2020-10-25 19:39:09,331 INFO L226 Difference]: Without dead ends: 2337 [2020-10-25 19:39:09,334 INFO L677 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 [2020-10-25 19:39:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-10-25 19:39:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2327. [2020-10-25 19:39:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2020-10-25 19:39:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2955 transitions. [2020-10-25 19:39:09,410 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2955 transitions. Word has length 471 [2020-10-25 19:39:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:09,411 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 2955 transitions. [2020-10-25 19:39:09,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2955 transitions. [2020-10-25 19:39:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2020-10-25 19:39:09,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:09,419 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:09,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-25 19:39:09,419 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1625661125, now seen corresponding path program 1 times [2020-10-25 19:39:09,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:09,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726868495] [2020-10-25 19:39:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2020-10-25 19:39:09,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726868495] [2020-10-25 19:39:09,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:09,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:09,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73728075] [2020-10-25 19:39:09,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:09,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:09,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:09,721 INFO L87 Difference]: Start difference. First operand 2327 states and 2955 transitions. Second operand 3 states. [2020-10-25 19:39:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:09,937 INFO L93 Difference]: Finished difference Result 4641 states and 5888 transitions. [2020-10-25 19:39:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:09,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 533 [2020-10-25 19:39:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:09,943 INFO L225 Difference]: With dead ends: 4641 [2020-10-25 19:39:09,943 INFO L226 Difference]: Without dead ends: 2322 [2020-10-25 19:39:09,946 INFO L677 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 [2020-10-25 19:39:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2020-10-25 19:39:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2020-10-25 19:39:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2020-10-25 19:39:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2885 transitions. [2020-10-25 19:39:10,019 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2885 transitions. Word has length 533 [2020-10-25 19:39:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:10,020 INFO L481 AbstractCegarLoop]: Abstraction has 2322 states and 2885 transitions. [2020-10-25 19:39:10,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2885 transitions. [2020-10-25 19:39:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-10-25 19:39:10,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:10,027 INFO L422 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] [2020-10-25 19:39:10,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 19:39:10,027 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2020-10-25 19:39:10,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:10,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978185554] [2020-10-25 19:39:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2020-10-25 19:39:10,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978185554] [2020-10-25 19:39:10,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100080942] [2020-10-25 19:39:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:39:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:10,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 19:39:10,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:39:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2020-10-25 19:39:10,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:39:10,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-25 19:39:10,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325306791] [2020-10-25 19:39:10,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:39:10,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:39:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:39:10,679 INFO L87 Difference]: Start difference. First operand 2322 states and 2885 transitions. Second operand 4 states. [2020-10-25 19:39:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:10,975 INFO L93 Difference]: Finished difference Result 3917 states and 4895 transitions. [2020-10-25 19:39:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:39:10,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2020-10-25 19:39:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:10,977 INFO L225 Difference]: With dead ends: 3917 [2020-10-25 19:39:10,977 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 19:39:10,980 INFO L677 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 [2020-10-25 19:39:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 19:39:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 19:39:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 19:39:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 19:39:10,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2020-10-25 19:39:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:10,982 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 19:39:10,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:39:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 19:39:10,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 19:39:11,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-10-25 19:39:11,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 19:39:12,332 WARN L193 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2020-10-25 19:39:13,465 WARN L193 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2020-10-25 19:39:14,265 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2020-10-25 19:39:14,592 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2020-10-25 19:39:14,908 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-10-25 19:39:15,518 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2020-10-25 19:39:18,749 WARN L193 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 172 DAG size of output: 106 [2020-10-25 19:39:19,396 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2020-10-25 19:39:19,819 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-10-25 19:39:20,124 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 22 [2020-10-25 19:39:20,552 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2020-10-25 19:39:21,053 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2020-10-25 19:39:24,256 WARN L193 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 172 DAG size of output: 106 [2020-10-25 19:39:24,684 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2020-10-25 19:39:25,271 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2020-10-25 19:39:25,639 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-10-25 19:39:25,952 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-10-25 19:39:26,365 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2020-10-25 19:39:26,779 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-10-25 19:39:27,096 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-10-25 19:39:27,342 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2020-10-25 19:39:28,014 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2020-10-25 19:39:28,267 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 19 [2020-10-25 19:39:28,272 INFO L274 CegarLoopResult]: For program point L531(lines 531 537) no Hoare annotation was computed. [2020-10-25 19:39:28,272 INFO L274 CegarLoopResult]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2020-10-25 19:39:28,273 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 19:39:28,273 INFO L274 CegarLoopResult]: For program point L334(lines 334 368) no Hoare annotation was computed. [2020-10-25 19:39:28,273 INFO L274 CegarLoopResult]: For program point L334-1(lines 334 368) no Hoare annotation was computed. [2020-10-25 19:39:28,273 INFO L274 CegarLoopResult]: For program point L202(lines 202 547) no Hoare annotation was computed. [2020-10-25 19:39:28,274 INFO L274 CegarLoopResult]: For program point L169(lines 169 558) no Hoare annotation was computed. [2020-10-25 19:39:28,274 INFO L274 CegarLoopResult]: For program point L136(lines 136 569) no Hoare annotation was computed. [2020-10-25 19:39:28,274 INFO L274 CegarLoopResult]: For program point L103(lines 103 580) no Hoare annotation was computed. [2020-10-25 19:39:28,274 INFO L274 CegarLoopResult]: For program point L467(lines 467 469) no Hoare annotation was computed. [2020-10-25 19:39:28,274 INFO L274 CegarLoopResult]: For program point L401(lines 401 403) no Hoare annotation was computed. [2020-10-25 19:39:28,274 INFO L274 CegarLoopResult]: For program point L335(lines 335 365) no Hoare annotation was computed. [2020-10-25 19:39:28,275 INFO L270 CegarLoopResult]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse0 .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1))) [2020-10-25 19:39:28,275 INFO L270 CegarLoopResult]: At program point L104(lines 103 580) the Hoare annotation is: false [2020-10-25 19:39:28,275 INFO L277 CegarLoopResult]: At program point L600(lines 99 601) the Hoare annotation is: true [2020-10-25 19:39:28,275 INFO L274 CegarLoopResult]: For program point L534(lines 534 536) no Hoare annotation was computed. [2020-10-25 19:39:28,275 INFO L274 CegarLoopResult]: For program point L205(lines 205 546) no Hoare annotation was computed. [2020-10-25 19:39:28,276 INFO L274 CegarLoopResult]: For program point L172(lines 172 557) no Hoare annotation was computed. [2020-10-25 19:39:28,276 INFO L274 CegarLoopResult]: For program point L139(lines 139 568) no Hoare annotation was computed. [2020-10-25 19:39:28,276 INFO L274 CegarLoopResult]: For program point L106(lines 106 579) no Hoare annotation was computed. [2020-10-25 19:39:28,276 INFO L274 CegarLoopResult]: For program point L305(lines 305 312) no Hoare annotation was computed. [2020-10-25 19:39:28,276 INFO L274 CegarLoopResult]: For program point L305-2(lines 305 312) no Hoare annotation was computed. [2020-10-25 19:39:28,277 INFO L270 CegarLoopResult]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-10-25 19:39:28,277 INFO L270 CegarLoopResult]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,277 INFO L270 CegarLoopResult]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-10-25 19:39:28,277 INFO L274 CegarLoopResult]: For program point L340(lines 340 363) no Hoare annotation was computed. [2020-10-25 19:39:28,278 INFO L270 CegarLoopResult]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-10-25 19:39:28,278 INFO L274 CegarLoopResult]: For program point L175(lines 175 556) no Hoare annotation was computed. [2020-10-25 19:39:28,278 INFO L274 CegarLoopResult]: For program point L142(lines 142 567) no Hoare annotation was computed. [2020-10-25 19:39:28,278 INFO L274 CegarLoopResult]: For program point L109(lines 109 578) no Hoare annotation was computed. [2020-10-25 19:39:28,278 INFO L274 CegarLoopResult]: For program point L605(lines 605 607) no Hoare annotation was computed. [2020-10-25 19:39:28,278 INFO L274 CegarLoopResult]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2020-10-25 19:39:28,279 INFO L274 CegarLoopResult]: For program point L506(lines 506 509) no Hoare annotation was computed. [2020-10-25 19:39:28,279 INFO L274 CegarLoopResult]: For program point L275(lines 275 277) no Hoare annotation was computed. [2020-10-25 19:39:28,279 INFO L274 CegarLoopResult]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2020-10-25 19:39:28,279 INFO L274 CegarLoopResult]: For program point L441(lines 441 443) no Hoare annotation was computed. [2020-10-25 19:39:28,279 INFO L274 CegarLoopResult]: For program point L309(lines 309 311) no Hoare annotation was computed. [2020-10-25 19:39:28,279 INFO L274 CegarLoopResult]: For program point L343(lines 343 347) no Hoare annotation was computed. [2020-10-25 19:39:28,280 INFO L274 CegarLoopResult]: For program point L343-2(lines 343 347) no Hoare annotation was computed. [2020-10-25 19:39:28,280 INFO L274 CegarLoopResult]: For program point L244(lines 244 254) no Hoare annotation was computed. [2020-10-25 19:39:28,280 INFO L274 CegarLoopResult]: For program point L178(lines 178 555) no Hoare annotation was computed. [2020-10-25 19:39:28,280 INFO L274 CegarLoopResult]: For program point L145(lines 145 566) no Hoare annotation was computed. [2020-10-25 19:39:28,280 INFO L274 CegarLoopResult]: For program point L112(lines 112 577) no Hoare annotation was computed. [2020-10-25 19:39:28,280 INFO L274 CegarLoopResult]: For program point L476(lines 476 478) no Hoare annotation was computed. [2020-10-25 19:39:28,281 INFO L274 CegarLoopResult]: For program point L377(lines 377 409) no Hoare annotation was computed. [2020-10-25 19:39:28,281 INFO L274 CegarLoopResult]: For program point L245(lines 245 248) no Hoare annotation was computed. [2020-10-25 19:39:28,281 INFO L270 CegarLoopResult]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2020-10-25 19:39:28,281 INFO L270 CegarLoopResult]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,282 INFO L270 CegarLoopResult]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,282 INFO L274 CegarLoopResult]: For program point L444(lines 444 453) no Hoare annotation was computed. [2020-10-25 19:39:28,282 INFO L274 CegarLoopResult]: For program point L378(lines 378 384) no Hoare annotation was computed. [2020-10-25 19:39:28,282 INFO L277 CegarLoopResult]: At program point L610(lines 12 612) the Hoare annotation is: true [2020-10-25 19:39:28,283 INFO L270 CegarLoopResult]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse26 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse23 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse25 (not .cse4)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not .cse22)) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse5) (and .cse0 .cse4 .cse6 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse20) (and .cse0 .cse9 .cse6) (and .cse21 .cse22) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse23 .cse18 .cse24 .cse25) (and .cse21 .cse26) (and .cse23 .cse20) (and .cse9 .cse18 .cse24) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse12 .cse6 .cse14 .cse19) (and .cse27 .cse23 .cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25) (and .cse0 .cse13 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse27 .cse4 .cse14) (and .cse2 .cse9 .cse28 .cse4 .cse24) (and .cse0 .cse2 .cse28 .cse24 .cse29 .cse5) (and .cse1 .cse2 .cse3 .cse25) (and .cse4 .cse26 .cse5) (and .cse0 .cse30 .cse4 .cse5) (and .cse21 .cse2 .cse28 .cse24) (and .cse5 .cse20) (and .cse0 .cse21 .cse6) (and .cse2 .cse28 .cse24 .cse29 .cse5 .cse25) (and .cse21 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse4 .cse5) (and .cse4 .cse22 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2020-10-25 19:39:28,283 INFO L274 CegarLoopResult]: For program point L181(lines 181 554) no Hoare annotation was computed. [2020-10-25 19:39:28,283 INFO L274 CegarLoopResult]: For program point L148(lines 148 565) no Hoare annotation was computed. [2020-10-25 19:39:28,283 INFO L274 CegarLoopResult]: For program point L115(lines 115 576) no Hoare annotation was computed. [2020-10-25 19:39:28,283 INFO L274 CegarLoopResult]: For program point L479(lines 479 483) no Hoare annotation was computed. [2020-10-25 19:39:28,283 INFO L274 CegarLoopResult]: For program point L479-2(lines 479 483) no Hoare annotation was computed. [2020-10-25 19:39:28,284 INFO L274 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2020-10-25 19:39:28,284 INFO L274 CegarLoopResult]: For program point L514(lines 514 516) no Hoare annotation was computed. [2020-10-25 19:39:28,284 INFO L274 CegarLoopResult]: For program point L448(lines 448 450) no Hoare annotation was computed. [2020-10-25 19:39:28,284 INFO L274 CegarLoopResult]: For program point L217(lines 217 219) no Hoare annotation was computed. [2020-10-25 19:39:28,284 INFO L274 CegarLoopResult]: For program point L184(lines 184 553) no Hoare annotation was computed. [2020-10-25 19:39:28,284 INFO L274 CegarLoopResult]: For program point L151(lines 151 564) no Hoare annotation was computed. [2020-10-25 19:39:28,285 INFO L274 CegarLoopResult]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2020-10-25 19:39:28,285 INFO L274 CegarLoopResult]: For program point L118(lines 118 575) no Hoare annotation was computed. [2020-10-25 19:39:28,285 INFO L274 CegarLoopResult]: For program point L581(lines 581 597) no Hoare annotation was computed. [2020-10-25 19:39:28,285 INFO L270 CegarLoopResult]: At program point L515(lines 73 611) the Hoare annotation is: false [2020-10-25 19:39:28,285 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 19:39:28,286 INFO L270 CegarLoopResult]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2020-10-25 19:39:28,286 INFO L270 CegarLoopResult]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,286 INFO L274 CegarLoopResult]: For program point L86(lines 86 88) no Hoare annotation was computed. [2020-10-25 19:39:28,286 INFO L274 CegarLoopResult]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2020-10-25 19:39:28,286 INFO L274 CegarLoopResult]: For program point L582(lines 582 596) no Hoare annotation was computed. [2020-10-25 19:39:28,286 INFO L274 CegarLoopResult]: For program point L351(lines 351 359) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L583(lines 583 588) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L517(lines 517 519) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L270 CegarLoopResult]: At program point L352(lines 328 370) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L187(lines 187 552) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L154(lines 154 563) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L121(lines 121 574) no Hoare annotation was computed. [2020-10-25 19:39:28,287 INFO L274 CegarLoopResult]: For program point L419(lines 419 421) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L270 CegarLoopResult]: At program point L386(lines 377 409) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 19:39:28,288 INFO L270 CegarLoopResult]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse0 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L585(lines 585 587) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L354(lines 354 356) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L288(lines 288 290) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L288-2(lines 209 543) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L322-2(lines 209 543) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L190(lines 190 551) no Hoare annotation was computed. [2020-10-25 19:39:28,288 INFO L274 CegarLoopResult]: For program point L157(lines 157 562) no Hoare annotation was computed. [2020-10-25 19:39:28,289 INFO L274 CegarLoopResult]: For program point L124(lines 124 573) no Hoare annotation was computed. [2020-10-25 19:39:28,289 INFO L274 CegarLoopResult]: For program point L91(lines 91 95) no Hoare annotation was computed. [2020-10-25 19:39:28,289 INFO L274 CegarLoopResult]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2020-10-25 19:39:28,289 INFO L274 CegarLoopResult]: For program point L521(lines 521 525) no Hoare annotation was computed. [2020-10-25 19:39:28,289 INFO L274 CegarLoopResult]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2020-10-25 19:39:28,289 INFO L274 CegarLoopResult]: For program point L389(lines 389 407) no Hoare annotation was computed. [2020-10-25 19:39:28,290 INFO L270 CegarLoopResult]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-10-25 19:39:28,290 INFO L270 CegarLoopResult]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 19:39:28,290 INFO L270 CegarLoopResult]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,290 INFO L274 CegarLoopResult]: For program point L92(lines 92 94) no Hoare annotation was computed. [2020-10-25 19:39:28,291 INFO L274 CegarLoopResult]: For program point L489(lines 489 492) no Hoare annotation was computed. [2020-10-25 19:39:28,291 INFO L274 CegarLoopResult]: For program point L390(lines 390 396) no Hoare annotation was computed. [2020-10-25 19:39:28,291 INFO L277 CegarLoopResult]: At program point L622(lines 613 624) the Hoare annotation is: true [2020-10-25 19:39:28,291 INFO L274 CegarLoopResult]: For program point L193(lines 193 550) no Hoare annotation was computed. [2020-10-25 19:39:28,291 INFO L274 CegarLoopResult]: For program point L160(lines 160 561) no Hoare annotation was computed. [2020-10-25 19:39:28,291 INFO L274 CegarLoopResult]: For program point L127(lines 127 572) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point L590(lines 590 594) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point L458(lines 458 460) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point L260(lines 260 262) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point L227(lines 227 238) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2020-10-25 19:39:28,292 INFO L274 CegarLoopResult]: For program point L294(lines 294 298) no Hoare annotation was computed. [2020-10-25 19:39:28,293 INFO L274 CegarLoopResult]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2020-10-25 19:39:28,293 INFO L274 CegarLoopResult]: For program point L427-1(lines 427 435) no Hoare annotation was computed. [2020-10-25 19:39:28,293 INFO L274 CegarLoopResult]: For program point L229(lines 229 232) no Hoare annotation was computed. [2020-10-25 19:39:28,293 INFO L274 CegarLoopResult]: For program point L196(lines 196 549) no Hoare annotation was computed. [2020-10-25 19:39:28,293 INFO L274 CegarLoopResult]: For program point L163(lines 163 560) no Hoare annotation was computed. [2020-10-25 19:39:28,293 INFO L274 CegarLoopResult]: For program point L130(lines 130 571) no Hoare annotation was computed. [2020-10-25 19:39:28,294 INFO L274 CegarLoopResult]: For program point L494(lines 494 500) no Hoare annotation was computed. [2020-10-25 19:39:28,294 INFO L270 CegarLoopResult]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5)))) [2020-10-25 19:39:28,294 INFO L270 CegarLoopResult]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 19:39:28,294 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 19:39:28,295 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 19:39:28,295 INFO L274 CegarLoopResult]: For program point L430(lines 430 433) no Hoare annotation was computed. [2020-10-25 19:39:28,295 INFO L274 CegarLoopResult]: For program point L331(lines 331 369) no Hoare annotation was computed. [2020-10-25 19:39:28,295 INFO L274 CegarLoopResult]: For program point L199(lines 199 548) no Hoare annotation was computed. [2020-10-25 19:39:28,295 INFO L274 CegarLoopResult]: For program point L166(lines 166 559) no Hoare annotation was computed. [2020-10-25 19:39:28,295 INFO L274 CegarLoopResult]: For program point L133(lines 133 570) no Hoare annotation was computed. [2020-10-25 19:39:28,296 INFO L270 CegarLoopResult]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse26 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse23 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse25 (not .cse4)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not .cse22)) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse5) (and .cse0 .cse4 .cse6 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse20) (and .cse0 .cse9 .cse6) (and .cse21 .cse22) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse23 .cse18 .cse24 .cse25) (and .cse21 .cse26) (and .cse23 .cse20) (and .cse9 .cse18 .cse24) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse12 .cse6 .cse14 .cse19) (and .cse27 .cse23 .cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25) (and .cse0 .cse13 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse27 .cse4 .cse14) (and .cse2 .cse9 .cse28 .cse4 .cse24) (and .cse0 .cse2 .cse28 .cse24 .cse29 .cse5) (and .cse1 .cse2 .cse3 .cse25) (and .cse4 .cse26 .cse5) (and .cse0 .cse30 .cse4 .cse5) (and .cse21 .cse2 .cse28 .cse24) (and .cse5 .cse20) (and .cse0 .cse21 .cse6) (and .cse2 .cse28 .cse24 .cse29 .cse5 .cse25) (and .cse21 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse4 .cse5) (and .cse4 .cse22 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2020-10-25 19:39:28,296 INFO L274 CegarLoopResult]: For program point L497(lines 497 499) no Hoare annotation was computed. [2020-10-25 19:39:28,296 INFO L274 CegarLoopResult]: For program point L497-2(lines 209 543) no Hoare annotation was computed. [2020-10-25 19:39:28,297 INFO L270 CegarLoopResult]: At program point L398(lines 389 407) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-10-25 19:39:28,297 INFO L274 CegarLoopResult]: For program point L233(lines 233 236) no Hoare annotation was computed. [2020-10-25 19:39:28,297 INFO L270 CegarLoopResult]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (not .cse2)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3))) [2020-10-25 19:39:28,297 INFO L270 CegarLoopResult]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-10-25 19:39:28,297 INFO L274 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-10-25 19:39:28,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:39:28 BoogieIcfgContainer [2020-10-25 19:39:28,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:39:28,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:39:28,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:39:28,351 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:39:28,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:38:52" (3/4) ... [2020-10-25 19:39:28,355 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 19:39:28,374 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-25 19:39:28,375 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 19:39:28,376 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:39:28,377 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:39:28,487 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:39:28,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:39:28,489 INFO L168 Benchmark]: Toolchain (without parser) took 37511.78 ms. Allocated memory was 44.0 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 21.7 MB in the beginning and 512.5 MB in the end (delta: -490.8 MB). Peak memory consumption was 689.4 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,489 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 44.0 MB. Free memory was 25.2 MB in the beginning and 25.1 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:39:28,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.36 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 30.1 MB in the beginning and 37.2 MB in the end (delta: -7.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.80 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 34.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,491 INFO L168 Benchmark]: Boogie Preprocessor took 44.17 ms. Allocated memory is still 54.5 MB. Free memory was 34.2 MB in the beginning and 32.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,491 INFO L168 Benchmark]: RCFGBuilder took 998.18 ms. Allocated memory is still 54.5 MB. Free memory was 32.1 MB in the beginning and 28.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,491 INFO L168 Benchmark]: TraceAbstraction took 35793.05 ms. Allocated memory was 54.5 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 28.3 MB in the beginning and 527.2 MB in the end (delta: -498.9 MB). Peak memory consumption was 728.6 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,492 INFO L168 Benchmark]: Witness Printer took 136.88 ms. Allocated memory is still 1.2 GB. Free memory was 527.2 MB in the beginning and 512.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:28,494 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 44.0 MB. Free memory was 25.2 MB in the beginning and 25.1 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 452.36 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 30.1 MB in the beginning and 37.2 MB in the end (delta: -7.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.80 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 34.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.17 ms. Allocated memory is still 54.5 MB. Free memory was 34.2 MB in the beginning and 32.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 998.18 ms. Allocated memory is still 54.5 MB. Free memory was 32.1 MB in the beginning and 28.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 35793.05 ms. Allocated memory was 54.5 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 28.3 MB in the beginning and 527.2 MB in the end (delta: -498.9 MB). Peak memory consumption was 728.6 MB. Max. memory is 16.1 GB. * Witness Printer took 136.88 ms. Allocated memory is still 1.2 GB. Free memory was 527.2 MB in the beginning and 512.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 118]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8448 <= s__state) && 2 == blastFlag) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && blastFlag == 0) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) || (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8673)) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((((!(s__state == 8673) && s__state <= 8672) && blastFlag == 1) && s__hit == 0) && 8640 <= s__state) && !(s__state == 8672))) || (((((!(s__state == 8673) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || ((s__hit == 0 && s__state == 8512) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__hit == 0) && s__state <= 8576) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (blastFlag == 1 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (blastFlag == 0 && s__state == 8544)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag == 0 && 8560 == s__state)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && s__hit == 0) && 2 == blastFlag)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && s__hit == 0) && 8640 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) && !(s__hit == 0))) || ((s__hit == 0 && 8560 == s__state) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (2 == blastFlag && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0))) || (blastFlag == 0 && s__state <= 3)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((s__state == 8528 && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && s__state == 8544) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && !(8448 == s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && !(8448 == s__state))) || ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && !(8448 == s__state)) && s__hit == 0) && 2 == blastFlag) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) || (((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) && !(s__hit == 0))) || (((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || ((s__hit == 0 && s__state == 8512) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__hit == 0) && s__state <= 8576) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (blastFlag == 1 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (blastFlag == 0 && s__state == 8544)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag == 0 && 8560 == s__state)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && s__hit == 0) && 2 == blastFlag)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && s__hit == 0) && 8640 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) && !(s__hit == 0))) || ((s__hit == 0 && 8560 == s__state) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (2 == blastFlag && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0))) || (blastFlag == 0 && s__state <= 3)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((s__state == 8528 && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && s__state == 8544) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && s__hit == 0) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) && 2 == blastFlag) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && 8448 <= s__state)) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && 8448 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && s__s3__tmp__next_state___0 <= 8640) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8672 <= s__state) && !(12292 == s__state)) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(12292 == s__state))) || ((blastFlag == 1 && 8672 <= s__state) && !(12292 == s__state)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag) || (blastFlag == 0 && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.5s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6694 SDtfs, 4128 SDslu, 3183 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1999 GetRequests, 1954 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4086occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3347 HoareAnnotationTreeSize, 28 FomulaSimplifications, 155193 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 28 FomulaSimplificationsInter, 30432 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 9249 NumberOfCodeBlocks, 9249 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9209 ConstructedInterpolants, 0 QuantifiedInterpolants, 3966998 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...