./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28eb30d9833654ceca3228385af91acd247ea794 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:37:52,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:37:52,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:37:52,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:37:52,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:37:52,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:37:52,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:37:52,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:37:52,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:37:52,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:37:52,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:37:52,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:37:52,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:37:52,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:37:52,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:37:52,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:37:52,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:37:52,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:37:52,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:37:52,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:37:52,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:37:52,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:37:52,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:37:52,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:37:52,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:37:52,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:37:52,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:37:52,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:37:52,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:37:52,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:37:52,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:37:52,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:37:52,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:37:52,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:37:52,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:37:52,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:37:52,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:37:52,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:37:52,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:37:52,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:37:52,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:37:52,771 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 08:37:52,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:37:52,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:37:52,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:37:52,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:37:52,797 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:37:52,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:37:52,798 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:37:52,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:37:52,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:37:52,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:37:52,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:37:52,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:37:52,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:37:52,799 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:37:52,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:37:52,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:37:52,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:37:52,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:37:52,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:37:52,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:37:52,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:37:52,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:37:52,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:37:52,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:37:52,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:37:52,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:37:52,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:37:52,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:37:52,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 28eb30d9833654ceca3228385af91acd247ea794 [2019-11-20 08:37:52,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:37:52,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:37:52,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:37:52,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:37:52,980 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:37:52,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c [2019-11-20 08:37:53,043 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/data/8aa5bf018/c77a9d92a53549a8b6e6d8cc87728c6a/FLAG7642146af [2019-11-20 08:37:53,552 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:37:53,555 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c [2019-11-20 08:37:53,572 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/data/8aa5bf018/c77a9d92a53549a8b6e6d8cc87728c6a/FLAG7642146af [2019-11-20 08:37:53,836 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/data/8aa5bf018/c77a9d92a53549a8b6e6d8cc87728c6a [2019-11-20 08:37:53,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:37:53,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:37:53,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:37:53,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:37:53,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:37:53,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:37:53" (1/1) ... [2019-11-20 08:37:53,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e403a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:53, skipping insertion in model container [2019-11-20 08:37:53,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:37:53" (1/1) ... [2019-11-20 08:37:53,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:37:53,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:37:54,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:37:54,254 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:37:54,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:37:54,326 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:37:54,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54 WrapperNode [2019-11-20 08:37:54,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:37:54,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:37:54,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:37:54,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:37:54,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:37:54,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:37:54,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:37:54,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:37:54,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... [2019-11-20 08:37:54,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:37:54,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:37:54,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:37:54,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:37:54,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:37:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:37:54,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:37:54,608 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 08:37:55,252 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 08:37:55,253 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 08:37:55,254 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:37:55,255 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 08:37:55,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:55 BoogieIcfgContainer [2019-11-20 08:37:55,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:37:55,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:37:55,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:37:55,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:37:55,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:37:53" (1/3) ... [2019-11-20 08:37:55,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371786d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:37:55, skipping insertion in model container [2019-11-20 08:37:55,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:54" (2/3) ... [2019-11-20 08:37:55,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371786d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:37:55, skipping insertion in model container [2019-11-20 08:37:55,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:55" (3/3) ... [2019-11-20 08:37:55,268 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-11-20 08:37:55,279 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:37:55,289 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:37:55,300 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:37:55,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:37:55,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:37:55,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:37:55,351 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:37:55,351 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:37:55,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:37:55,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:37:55,352 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:37:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-20 08:37:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:37:55,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:55,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:55,389 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-20 08:37:55,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:55,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752792393] [2019-11-20 08:37:55,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:55,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752792393] [2019-11-20 08:37:55,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:55,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:55,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589721597] [2019-11-20 08:37:55,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:55,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:55,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:55,667 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-20 08:37:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:56,054 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-20 08:37:56,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:56,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 08:37:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:56,080 INFO L225 Difference]: With dead ends: 327 [2019-11-20 08:37:56,080 INFO L226 Difference]: Without dead ends: 174 [2019-11-20 08:37:56,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-20 08:37:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-20 08:37:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 08:37:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-20 08:37:56,178 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-20 08:37:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:56,179 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-20 08:37:56,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-20 08:37:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 08:37:56,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:56,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:56,190 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-20 08:37:56,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:56,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841741223] [2019-11-20 08:37:56,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:56,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841741223] [2019-11-20 08:37:56,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:56,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:56,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634219441] [2019-11-20 08:37:56,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:56,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:56,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:56,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:56,321 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-20 08:37:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:56,595 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-20 08:37:56,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:56,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 08:37:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:56,599 INFO L225 Difference]: With dead ends: 379 [2019-11-20 08:37:56,599 INFO L226 Difference]: Without dead ends: 215 [2019-11-20 08:37:56,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-20 08:37:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-20 08:37:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 08:37:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-20 08:37:56,634 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-20 08:37:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:56,635 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-20 08:37:56,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-20 08:37:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 08:37:56,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:56,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:56,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-11-20 08:37:56,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:56,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178200309] [2019-11-20 08:37:56,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:56,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178200309] [2019-11-20 08:37:56,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:56,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:56,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827898720] [2019-11-20 08:37:56,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:56,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:56,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:56,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:56,705 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-20 08:37:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:56,944 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-20 08:37:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:56,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 08:37:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:56,948 INFO L225 Difference]: With dead ends: 444 [2019-11-20 08:37:56,948 INFO L226 Difference]: Without dead ends: 241 [2019-11-20 08:37:56,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-20 08:37:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-20 08:37:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-20 08:37:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-20 08:37:56,967 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-20 08:37:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:56,967 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-20 08:37:56,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-20 08:37:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 08:37:56,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:56,971 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:56,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-11-20 08:37:56,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:56,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8767724] [2019-11-20 08:37:56,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 08:37:57,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8767724] [2019-11-20 08:37:57,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:57,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:57,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28740017] [2019-11-20 08:37:57,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:57,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,050 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-20 08:37:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:57,218 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-20 08:37:57,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:57,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 08:37:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:57,221 INFO L225 Difference]: With dead ends: 492 [2019-11-20 08:37:57,221 INFO L226 Difference]: Without dead ends: 258 [2019-11-20 08:37:57,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-20 08:37:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-20 08:37:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-20 08:37:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-20 08:37:57,237 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-20 08:37:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:57,237 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-20 08:37:57,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-20 08:37:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 08:37:57,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:57,240 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:57,240 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-11-20 08:37:57,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:57,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216892361] [2019-11-20 08:37:57,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:57,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216892361] [2019-11-20 08:37:57,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:57,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:57,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813288337] [2019-11-20 08:37:57,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:57,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:57,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:57,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,299 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-20 08:37:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:57,512 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-20 08:37:57,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:57,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 08:37:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:57,516 INFO L225 Difference]: With dead ends: 551 [2019-11-20 08:37:57,516 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 08:37:57,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 08:37:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-20 08:37:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-20 08:37:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-20 08:37:57,533 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-20 08:37:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:57,534 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-20 08:37:57,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-20 08:37:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 08:37:57,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:57,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:57,537 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-11-20 08:37:57,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:57,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348745159] [2019-11-20 08:37:57,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 08:37:57,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348745159] [2019-11-20 08:37:57,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:57,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:57,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031881052] [2019-11-20 08:37:57,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:57,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,602 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-20 08:37:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:57,772 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-20 08:37:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:57,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 08:37:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:57,775 INFO L225 Difference]: With dead ends: 591 [2019-11-20 08:37:57,775 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 08:37:57,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 08:37:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-20 08:37:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-20 08:37:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-20 08:37:57,788 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-20 08:37:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:57,789 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-20 08:37:57,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-20 08:37:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 08:37:57,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:57,791 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:57,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-11-20 08:37:57,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:57,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336088974] [2019-11-20 08:37:57,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:37:57,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336088974] [2019-11-20 08:37:57,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:57,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:57,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281785057] [2019-11-20 08:37:57,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:57,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:57,882 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-20 08:37:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:58,074 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-20 08:37:58,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:58,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 08:37:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:58,077 INFO L225 Difference]: With dead ends: 593 [2019-11-20 08:37:58,077 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 08:37:58,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 08:37:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-20 08:37:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-20 08:37:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-20 08:37:58,091 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-20 08:37:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:58,091 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-20 08:37:58,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-20 08:37:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 08:37:58,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:58,094 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:58,094 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-11-20 08:37:58,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:58,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666008938] [2019-11-20 08:37:58,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 08:37:58,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666008938] [2019-11-20 08:37:58,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:58,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:58,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143148105] [2019-11-20 08:37:58,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:58,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,168 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-20 08:37:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:58,282 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-20 08:37:58,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:58,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 08:37:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:58,285 INFO L225 Difference]: With dead ends: 594 [2019-11-20 08:37:58,285 INFO L226 Difference]: Without dead ends: 305 [2019-11-20 08:37:58,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-20 08:37:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-20 08:37:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-20 08:37:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-20 08:37:58,300 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-20 08:37:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:58,301 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-20 08:37:58,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-20 08:37:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 08:37:58,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:58,303 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:58,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-11-20 08:37:58,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:58,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983040681] [2019-11-20 08:37:58,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 08:37:58,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983040681] [2019-11-20 08:37:58,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:58,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991027629] [2019-11-20 08:37:58,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:58,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,372 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-20 08:37:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:58,528 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-20 08:37:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:58,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 08:37:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:58,531 INFO L225 Difference]: With dead ends: 634 [2019-11-20 08:37:58,531 INFO L226 Difference]: Without dead ends: 336 [2019-11-20 08:37:58,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-20 08:37:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-20 08:37:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-20 08:37:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-20 08:37:58,546 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-20 08:37:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:58,546 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-20 08:37:58,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-20 08:37:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 08:37:58,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:58,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:58,548 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-11-20 08:37:58,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:58,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965256298] [2019-11-20 08:37:58,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 08:37:58,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965256298] [2019-11-20 08:37:58,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:58,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:58,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010675190] [2019-11-20 08:37:58,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:58,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:58,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,589 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-20 08:37:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:58,735 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-20 08:37:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:58,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 08:37:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:58,737 INFO L225 Difference]: With dead ends: 663 [2019-11-20 08:37:58,737 INFO L226 Difference]: Without dead ends: 336 [2019-11-20 08:37:58,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-20 08:37:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-20 08:37:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-20 08:37:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-20 08:37:58,754 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-20 08:37:58,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:58,755 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-20 08:37:58,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-20 08:37:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 08:37:58,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:58,757 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:58,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:58,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-11-20 08:37:58,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:58,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198137040] [2019-11-20 08:37:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 08:37:58,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198137040] [2019-11-20 08:37:58,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:58,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:58,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747278288] [2019-11-20 08:37:58,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:58,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:58,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:58,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,812 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-20 08:37:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:58,981 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-20 08:37:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:58,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 08:37:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:58,984 INFO L225 Difference]: With dead ends: 696 [2019-11-20 08:37:58,984 INFO L226 Difference]: Without dead ends: 369 [2019-11-20 08:37:58,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-20 08:37:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-20 08:37:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 08:37:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-20 08:37:59,001 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-20 08:37:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:59,001 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-20 08:37:59,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-20 08:37:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 08:37:59,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:59,004 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:59,004 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-11-20 08:37:59,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:59,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774520286] [2019-11-20 08:37:59,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 08:37:59,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774520286] [2019-11-20 08:37:59,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:59,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:59,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468243939] [2019-11-20 08:37:59,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:59,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,049 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-20 08:37:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:59,238 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-20 08:37:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:59,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 08:37:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:59,241 INFO L225 Difference]: With dead ends: 723 [2019-11-20 08:37:59,241 INFO L226 Difference]: Without dead ends: 369 [2019-11-20 08:37:59,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-20 08:37:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-20 08:37:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 08:37:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-20 08:37:59,259 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-20 08:37:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:59,259 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-20 08:37:59,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-20 08:37:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 08:37:59,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:59,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:59,261 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-11-20 08:37:59,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:59,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058227235] [2019-11-20 08:37:59,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 08:37:59,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058227235] [2019-11-20 08:37:59,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:59,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:59,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11592192] [2019-11-20 08:37:59,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:59,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,309 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-20 08:37:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:59,477 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-11-20 08:37:59,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:59,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 08:37:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:59,480 INFO L225 Difference]: With dead ends: 741 [2019-11-20 08:37:59,481 INFO L226 Difference]: Without dead ends: 387 [2019-11-20 08:37:59,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-20 08:37:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-20 08:37:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-20 08:37:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-20 08:37:59,500 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-20 08:37:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:59,501 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-20 08:37:59,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-20 08:37:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 08:37:59,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:59,505 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:59,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-11-20 08:37:59,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:59,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598029284] [2019-11-20 08:37:59,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 08:37:59,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598029284] [2019-11-20 08:37:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:37:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834324300] [2019-11-20 08:37:59,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,561 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-20 08:37:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:59,749 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-11-20 08:37:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:59,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 08:37:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:59,752 INFO L225 Difference]: With dead ends: 762 [2019-11-20 08:37:59,752 INFO L226 Difference]: Without dead ends: 387 [2019-11-20 08:37:59,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-20 08:37:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-20 08:37:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-20 08:37:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-20 08:37:59,771 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-20 08:37:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:59,771 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-20 08:37:59,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-20 08:37:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 08:37:59,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:59,774 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:59,774 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-11-20 08:37:59,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:59,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652188497] [2019-11-20 08:37:59,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 08:37:59,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652188497] [2019-11-20 08:37:59,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:59,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:37:59,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697585824] [2019-11-20 08:37:59,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:59,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,834 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-20 08:37:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:37:59,883 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-20 08:37:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:37:59,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 08:37:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:37:59,888 INFO L225 Difference]: With dead ends: 757 [2019-11-20 08:37:59,888 INFO L226 Difference]: Without dead ends: 755 [2019-11-20 08:37:59,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-20 08:37:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-20 08:37:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-20 08:37:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-20 08:37:59,924 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-20 08:37:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:37:59,924 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-20 08:37:59,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:37:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-20 08:37:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 08:37:59,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:37:59,928 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:37:59,928 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:37:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:37:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1007661097, now seen corresponding path program 1 times [2019-11-20 08:37:59,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:37:59,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972720028] [2019-11-20 08:37:59,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:37:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:37:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 08:37:59,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972720028] [2019-11-20 08:37:59,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:37:59,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:37:59,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311432181] [2019-11-20 08:37:59,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:37:59,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:37:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:37:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:37:59,980 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-20 08:38:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:00,039 INFO L93 Difference]: Finished difference Result 1871 states and 2963 transitions. [2019-11-20 08:38:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:00,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 08:38:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:00,047 INFO L225 Difference]: With dead ends: 1871 [2019-11-20 08:38:00,047 INFO L226 Difference]: Without dead ends: 1123 [2019-11-20 08:38:00,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-20 08:38:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-20 08:38:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-20 08:38:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1776 transitions. [2019-11-20 08:38:00,094 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1776 transitions. Word has length 121 [2019-11-20 08:38:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:00,095 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1776 transitions. [2019-11-20 08:38:00,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1776 transitions. [2019-11-20 08:38:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 08:38:00,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:00,099 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:00,099 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash 381632917, now seen corresponding path program 1 times [2019-11-20 08:38:00,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:00,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44711537] [2019-11-20 08:38:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 08:38:00,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44711537] [2019-11-20 08:38:00,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:00,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:38:00,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385840505] [2019-11-20 08:38:00,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:00,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:00,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:00,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,139 INFO L87 Difference]: Start difference. First operand 1123 states and 1776 transitions. Second operand 3 states. [2019-11-20 08:38:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:00,207 INFO L93 Difference]: Finished difference Result 2590 states and 4096 transitions. [2019-11-20 08:38:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:00,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 08:38:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:00,217 INFO L225 Difference]: With dead ends: 2590 [2019-11-20 08:38:00,218 INFO L226 Difference]: Without dead ends: 1474 [2019-11-20 08:38:00,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-11-20 08:38:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2019-11-20 08:38:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-11-20 08:38:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2327 transitions. [2019-11-20 08:38:00,279 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2327 transitions. Word has length 121 [2019-11-20 08:38:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:00,279 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2327 transitions. [2019-11-20 08:38:00,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2327 transitions. [2019-11-20 08:38:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 08:38:00,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:00,285 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:00,285 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2067443667, now seen corresponding path program 1 times [2019-11-20 08:38:00,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:00,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646848328] [2019-11-20 08:38:00,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-20 08:38:00,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646848328] [2019-11-20 08:38:00,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:00,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:00,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785079337] [2019-11-20 08:38:00,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:00,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:00,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,336 INFO L87 Difference]: Start difference. First operand 1474 states and 2327 transitions. Second operand 3 states. [2019-11-20 08:38:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:00,576 INFO L93 Difference]: Finished difference Result 2981 states and 4691 transitions. [2019-11-20 08:38:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:00,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 08:38:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:00,586 INFO L225 Difference]: With dead ends: 2981 [2019-11-20 08:38:00,586 INFO L226 Difference]: Without dead ends: 1514 [2019-11-20 08:38:00,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-11-20 08:38:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1474. [2019-11-20 08:38:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-11-20 08:38:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2183 transitions. [2019-11-20 08:38:00,645 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2183 transitions. Word has length 158 [2019-11-20 08:38:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:00,645 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2183 transitions. [2019-11-20 08:38:00,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2183 transitions. [2019-11-20 08:38:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 08:38:00,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:00,650 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:00,651 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1134888427, now seen corresponding path program 1 times [2019-11-20 08:38:00,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:00,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563763305] [2019-11-20 08:38:00,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-20 08:38:00,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563763305] [2019-11-20 08:38:00,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:00,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:00,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716098242] [2019-11-20 08:38:00,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:00,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:00,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,699 INFO L87 Difference]: Start difference. First operand 1474 states and 2183 transitions. Second operand 3 states. [2019-11-20 08:38:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:00,953 INFO L93 Difference]: Finished difference Result 3137 states and 4655 transitions. [2019-11-20 08:38:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:00,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 08:38:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:00,964 INFO L225 Difference]: With dead ends: 3137 [2019-11-20 08:38:00,965 INFO L226 Difference]: Without dead ends: 1670 [2019-11-20 08:38:00,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-11-20 08:38:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1554. [2019-11-20 08:38:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-20 08:38:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2243 transitions. [2019-11-20 08:38:01,034 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2243 transitions. Word has length 158 [2019-11-20 08:38:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:01,034 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2243 transitions. [2019-11-20 08:38:01,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2243 transitions. [2019-11-20 08:38:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 08:38:01,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:01,040 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:01,040 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1894065177, now seen corresponding path program 1 times [2019-11-20 08:38:01,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:01,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856648616] [2019-11-20 08:38:01,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-20 08:38:01,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856648616] [2019-11-20 08:38:01,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:01,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:01,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663868344] [2019-11-20 08:38:01,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:01,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:01,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:01,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:01,105 INFO L87 Difference]: Start difference. First operand 1554 states and 2243 transitions. Second operand 3 states. [2019-11-20 08:38:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:01,391 INFO L93 Difference]: Finished difference Result 3157 states and 4541 transitions. [2019-11-20 08:38:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:01,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-20 08:38:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:01,403 INFO L225 Difference]: With dead ends: 3157 [2019-11-20 08:38:01,403 INFO L226 Difference]: Without dead ends: 1610 [2019-11-20 08:38:01,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-11-20 08:38:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1554. [2019-11-20 08:38:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-20 08:38:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2181 transitions. [2019-11-20 08:38:01,509 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2181 transitions. Word has length 172 [2019-11-20 08:38:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:01,510 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2181 transitions. [2019-11-20 08:38:01,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2181 transitions. [2019-11-20 08:38:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 08:38:01,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:01,515 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:01,516 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:01,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:01,516 INFO L82 PathProgramCache]: Analyzing trace with hash -313542519, now seen corresponding path program 1 times [2019-11-20 08:38:01,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:01,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354309510] [2019-11-20 08:38:01,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-20 08:38:01,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354309510] [2019-11-20 08:38:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:01,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469695954] [2019-11-20 08:38:01,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:01,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:01,581 INFO L87 Difference]: Start difference. First operand 1554 states and 2181 transitions. Second operand 3 states. [2019-11-20 08:38:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:01,744 INFO L93 Difference]: Finished difference Result 3186 states and 4458 transitions. [2019-11-20 08:38:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:01,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-20 08:38:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:01,753 INFO L225 Difference]: With dead ends: 3186 [2019-11-20 08:38:01,753 INFO L226 Difference]: Without dead ends: 1639 [2019-11-20 08:38:01,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-20 08:38:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-20 08:38:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-20 08:38:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2265 transitions. [2019-11-20 08:38:01,809 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2265 transitions. Word has length 188 [2019-11-20 08:38:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:01,809 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2265 transitions. [2019-11-20 08:38:01,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2265 transitions. [2019-11-20 08:38:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-20 08:38:01,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:01,815 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 08:38:01,815 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1889247393, now seen corresponding path program 1 times [2019-11-20 08:38:01,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:01,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289786049] [2019-11-20 08:38:01,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-20 08:38:01,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289786049] [2019-11-20 08:38:01,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:01,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:01,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059571408] [2019-11-20 08:38:01,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:01,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:01,876 INFO L87 Difference]: Start difference. First operand 1623 states and 2265 transitions. Second operand 3 states. [2019-11-20 08:38:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:02,054 INFO L93 Difference]: Finished difference Result 3391 states and 4735 transitions. [2019-11-20 08:38:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:02,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-20 08:38:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:02,064 INFO L225 Difference]: With dead ends: 3391 [2019-11-20 08:38:02,064 INFO L226 Difference]: Without dead ends: 1775 [2019-11-20 08:38:02,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-11-20 08:38:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1723. [2019-11-20 08:38:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-20 08:38:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2385 transitions. [2019-11-20 08:38:02,126 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2385 transitions. Word has length 209 [2019-11-20 08:38:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:02,126 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2385 transitions. [2019-11-20 08:38:02,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2385 transitions. [2019-11-20 08:38:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 08:38:02,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:02,132 INFO L410 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] [2019-11-20 08:38:02,132 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash 627964964, now seen corresponding path program 1 times [2019-11-20 08:38:02,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:02,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192258651] [2019-11-20 08:38:02,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 08:38:02,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192258651] [2019-11-20 08:38:02,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:02,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:02,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380180096] [2019-11-20 08:38:02,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:02,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:02,191 INFO L87 Difference]: Start difference. First operand 1723 states and 2385 transitions. Second operand 3 states. [2019-11-20 08:38:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:02,405 INFO L93 Difference]: Finished difference Result 3493 states and 4821 transitions. [2019-11-20 08:38:02,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:02,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-20 08:38:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:02,415 INFO L225 Difference]: With dead ends: 3493 [2019-11-20 08:38:02,415 INFO L226 Difference]: Without dead ends: 1777 [2019-11-20 08:38:02,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-11-20 08:38:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1723. [2019-11-20 08:38:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-20 08:38:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2377 transitions. [2019-11-20 08:38:02,476 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2377 transitions. Word has length 212 [2019-11-20 08:38:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:02,476 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2377 transitions. [2019-11-20 08:38:02,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2377 transitions. [2019-11-20 08:38:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 08:38:02,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:02,490 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:02,490 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash 575806657, now seen corresponding path program 1 times [2019-11-20 08:38:02,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:02,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881900346] [2019-11-20 08:38:02,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-20 08:38:02,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881900346] [2019-11-20 08:38:02,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:02,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:02,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907730763] [2019-11-20 08:38:02,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:02,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:02,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:02,571 INFO L87 Difference]: Start difference. First operand 1723 states and 2377 transitions. Second operand 3 states. [2019-11-20 08:38:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:02,797 INFO L93 Difference]: Finished difference Result 3635 states and 5035 transitions. [2019-11-20 08:38:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:02,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-20 08:38:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:02,806 INFO L225 Difference]: With dead ends: 3635 [2019-11-20 08:38:02,806 INFO L226 Difference]: Without dead ends: 1819 [2019-11-20 08:38:02,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-11-20 08:38:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1779. [2019-11-20 08:38:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-20 08:38:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2421 transitions. [2019-11-20 08:38:02,870 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2421 transitions. Word has length 233 [2019-11-20 08:38:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:02,871 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2421 transitions. [2019-11-20 08:38:02,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2421 transitions. [2019-11-20 08:38:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 08:38:02,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:02,876 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 08:38:02,876 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 274134262, now seen corresponding path program 1 times [2019-11-20 08:38:02,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:02,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817278237] [2019-11-20 08:38:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-20 08:38:02,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817278237] [2019-11-20 08:38:02,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:02,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:02,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076971036] [2019-11-20 08:38:02,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:02,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:02,947 INFO L87 Difference]: Start difference. First operand 1779 states and 2421 transitions. Second operand 3 states. [2019-11-20 08:38:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:03,145 INFO L93 Difference]: Finished difference Result 3583 states and 4883 transitions. [2019-11-20 08:38:03,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:03,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-20 08:38:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:03,154 INFO L225 Difference]: With dead ends: 3583 [2019-11-20 08:38:03,154 INFO L226 Difference]: Without dead ends: 1811 [2019-11-20 08:38:03,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-20 08:38:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1779. [2019-11-20 08:38:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-20 08:38:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2401 transitions. [2019-11-20 08:38:03,223 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2401 transitions. Word has length 235 [2019-11-20 08:38:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:03,223 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2401 transitions. [2019-11-20 08:38:03,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2401 transitions. [2019-11-20 08:38:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-20 08:38:03,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:03,229 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:03,229 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2133876990, now seen corresponding path program 1 times [2019-11-20 08:38:03,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:03,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502814719] [2019-11-20 08:38:03,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-20 08:38:03,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502814719] [2019-11-20 08:38:03,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260715116] [2019-11-20 08:38:03,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:03,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:38:03,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-20 08:38:03,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:03,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:03,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794699345] [2019-11-20 08:38:03,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:03,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:03,557 INFO L87 Difference]: Start difference. First operand 1779 states and 2401 transitions. Second operand 3 states. [2019-11-20 08:38:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:03,648 INFO L93 Difference]: Finished difference Result 3573 states and 4829 transitions. [2019-11-20 08:38:03,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:03,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-20 08:38:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:03,660 INFO L225 Difference]: With dead ends: 3573 [2019-11-20 08:38:03,660 INFO L226 Difference]: Without dead ends: 2234 [2019-11-20 08:38:03,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-11-20 08:38:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2019-11-20 08:38:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-11-20 08:38:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3016 transitions. [2019-11-20 08:38:03,743 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3016 transitions. Word has length 245 [2019-11-20 08:38:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:03,744 INFO L462 AbstractCegarLoop]: Abstraction has 2234 states and 3016 transitions. [2019-11-20 08:38:03,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3016 transitions. [2019-11-20 08:38:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 08:38:03,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:03,750 INFO L410 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] [2019-11-20 08:38:03,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:03,958 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash -207038505, now seen corresponding path program 1 times [2019-11-20 08:38:03,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:03,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001069802] [2019-11-20 08:38:03,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-20 08:38:04,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001069802] [2019-11-20 08:38:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957361760] [2019-11-20 08:38:04,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:04,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:04,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-20 08:38:04,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:04,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:04,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974986790] [2019-11-20 08:38:04,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:04,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:04,317 INFO L87 Difference]: Start difference. First operand 2234 states and 3016 transitions. Second operand 4 states. [2019-11-20 08:38:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:04,814 INFO L93 Difference]: Finished difference Result 7148 states and 9660 transitions. [2019-11-20 08:38:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:38:04,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-20 08:38:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:04,846 INFO L225 Difference]: With dead ends: 7148 [2019-11-20 08:38:04,846 INFO L226 Difference]: Without dead ends: 4921 [2019-11-20 08:38:04,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2019-11-20 08:38:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 2779. [2019-11-20 08:38:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-11-20 08:38:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3666 transitions. [2019-11-20 08:38:04,963 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3666 transitions. Word has length 252 [2019-11-20 08:38:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:04,963 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3666 transitions. [2019-11-20 08:38:04,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3666 transitions. [2019-11-20 08:38:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 08:38:04,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:04,972 INFO L410 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] [2019-11-20 08:38:05,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:05,176 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash 81780885, now seen corresponding path program 1 times [2019-11-20 08:38:05,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:05,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629970992] [2019-11-20 08:38:05,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 08:38:05,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629970992] [2019-11-20 08:38:05,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:05,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:05,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641827069] [2019-11-20 08:38:05,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:05,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:05,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:05,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:05,273 INFO L87 Difference]: Start difference. First operand 2779 states and 3666 transitions. Second operand 3 states. [2019-11-20 08:38:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:05,390 INFO L93 Difference]: Finished difference Result 7808 states and 10356 transitions. [2019-11-20 08:38:05,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:05,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-20 08:38:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:05,400 INFO L225 Difference]: With dead ends: 7808 [2019-11-20 08:38:05,400 INFO L226 Difference]: Without dead ends: 5036 [2019-11-20 08:38:05,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-11-20 08:38:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5034. [2019-11-20 08:38:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-20 08:38:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6686 transitions. [2019-11-20 08:38:05,566 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6686 transitions. Word has length 252 [2019-11-20 08:38:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:05,566 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6686 transitions. [2019-11-20 08:38:05,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6686 transitions. [2019-11-20 08:38:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-20 08:38:05,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:05,576 INFO L410 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] [2019-11-20 08:38:05,576 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1389751562, now seen corresponding path program 1 times [2019-11-20 08:38:05,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:05,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332271615] [2019-11-20 08:38:05,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-20 08:38:05,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332271615] [2019-11-20 08:38:05,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:05,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:05,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980385961] [2019-11-20 08:38:05,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:05,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:05,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:05,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:05,658 INFO L87 Difference]: Start difference. First operand 5034 states and 6686 transitions. Second operand 3 states. [2019-11-20 08:38:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:05,987 INFO L93 Difference]: Finished difference Result 10161 states and 13481 transitions. [2019-11-20 08:38:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:05,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-20 08:38:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:05,996 INFO L225 Difference]: With dead ends: 10161 [2019-11-20 08:38:05,997 INFO L226 Difference]: Without dead ends: 5134 [2019-11-20 08:38:06,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2019-11-20 08:38:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5034. [2019-11-20 08:38:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-20 08:38:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6600 transitions. [2019-11-20 08:38:06,156 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6600 transitions. Word has length 255 [2019-11-20 08:38:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:06,157 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6600 transitions. [2019-11-20 08:38:06,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6600 transitions. [2019-11-20 08:38:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-20 08:38:06,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:06,167 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:06,167 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1038896286, now seen corresponding path program 1 times [2019-11-20 08:38:06,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:06,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037209182] [2019-11-20 08:38:06,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-20 08:38:06,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037209182] [2019-11-20 08:38:06,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287055995] [2019-11-20 08:38:06,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:06,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:06,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-20 08:38:06,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:06,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:06,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277524224] [2019-11-20 08:38:06,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:06,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:06,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:06,452 INFO L87 Difference]: Start difference. First operand 5034 states and 6600 transitions. Second operand 3 states. [2019-11-20 08:38:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:06,687 INFO L93 Difference]: Finished difference Result 10081 states and 13209 transitions. [2019-11-20 08:38:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:06,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-20 08:38:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:06,697 INFO L225 Difference]: With dead ends: 10081 [2019-11-20 08:38:06,697 INFO L226 Difference]: Without dead ends: 5054 [2019-11-20 08:38:06,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-11-20 08:38:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 5034. [2019-11-20 08:38:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-20 08:38:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6590 transitions. [2019-11-20 08:38:06,848 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6590 transitions. Word has length 281 [2019-11-20 08:38:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:06,848 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6590 transitions. [2019-11-20 08:38:06,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6590 transitions. [2019-11-20 08:38:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-20 08:38:06,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:06,859 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:07,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:07,063 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1898466533, now seen corresponding path program 1 times [2019-11-20 08:38:07,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:07,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460095772] [2019-11-20 08:38:07,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-20 08:38:07,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460095772] [2019-11-20 08:38:07,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304961949] [2019-11-20 08:38:07,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:07,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:07,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-20 08:38:07,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:07,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:07,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903915911] [2019-11-20 08:38:07,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:07,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:07,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:07,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:07,363 INFO L87 Difference]: Start difference. First operand 5034 states and 6590 transitions. Second operand 3 states. [2019-11-20 08:38:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:07,665 INFO L93 Difference]: Finished difference Result 10061 states and 13169 transitions. [2019-11-20 08:38:07,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:07,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-20 08:38:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:07,674 INFO L225 Difference]: With dead ends: 10061 [2019-11-20 08:38:07,674 INFO L226 Difference]: Without dead ends: 5034 [2019-11-20 08:38:07,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-20 08:38:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 5034. [2019-11-20 08:38:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-20 08:38:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6580 transitions. [2019-11-20 08:38:07,824 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6580 transitions. Word has length 282 [2019-11-20 08:38:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:07,825 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6580 transitions. [2019-11-20 08:38:07,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6580 transitions. [2019-11-20 08:38:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-20 08:38:07,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:07,835 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:08,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:08,040 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:08,041 INFO L82 PathProgramCache]: Analyzing trace with hash 89999279, now seen corresponding path program 1 times [2019-11-20 08:38:08,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:08,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127924336] [2019-11-20 08:38:08,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-20 08:38:08,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127924336] [2019-11-20 08:38:08,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223963486] [2019-11-20 08:38:08,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:08,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:08,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-20 08:38:08,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:08,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976301449] [2019-11-20 08:38:08,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:08,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:08,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:08,334 INFO L87 Difference]: Start difference. First operand 5034 states and 6580 transitions. Second operand 4 states. [2019-11-20 08:38:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:08,789 INFO L93 Difference]: Finished difference Result 11805 states and 15365 transitions. [2019-11-20 08:38:08,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:38:08,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-20 08:38:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:08,801 INFO L225 Difference]: With dead ends: 11805 [2019-11-20 08:38:08,802 INFO L226 Difference]: Without dead ends: 6712 [2019-11-20 08:38:08,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-11-20 08:38:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 4418. [2019-11-20 08:38:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2019-11-20 08:38:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 5699 transitions. [2019-11-20 08:38:08,949 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 5699 transitions. Word has length 282 [2019-11-20 08:38:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:08,950 INFO L462 AbstractCegarLoop]: Abstraction has 4418 states and 5699 transitions. [2019-11-20 08:38:08,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 5699 transitions. [2019-11-20 08:38:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-20 08:38:08,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:08,963 INFO L410 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] [2019-11-20 08:38:09,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:09,167 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:09,167 INFO L82 PathProgramCache]: Analyzing trace with hash -68994562, now seen corresponding path program 1 times [2019-11-20 08:38:09,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:09,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165051092] [2019-11-20 08:38:09,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-20 08:38:09,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165051092] [2019-11-20 08:38:09,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:09,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:09,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31576688] [2019-11-20 08:38:09,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:09,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:09,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:09,275 INFO L87 Difference]: Start difference. First operand 4418 states and 5699 transitions. Second operand 3 states. [2019-11-20 08:38:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:09,442 INFO L93 Difference]: Finished difference Result 7454 states and 9509 transitions. [2019-11-20 08:38:09,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:09,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-20 08:38:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:09,446 INFO L225 Difference]: With dead ends: 7454 [2019-11-20 08:38:09,446 INFO L226 Difference]: Without dead ends: 2235 [2019-11-20 08:38:09,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2019-11-20 08:38:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2019-11-20 08:38:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-11-20 08:38:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2837 transitions. [2019-11-20 08:38:09,511 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2837 transitions. Word has length 320 [2019-11-20 08:38:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:09,512 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2837 transitions. [2019-11-20 08:38:09,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2837 transitions. [2019-11-20 08:38:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-20 08:38:09,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:09,519 INFO L410 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] [2019-11-20 08:38:09,520 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash 439442017, now seen corresponding path program 1 times [2019-11-20 08:38:09,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:09,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740326299] [2019-11-20 08:38:09,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-20 08:38:09,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740326299] [2019-11-20 08:38:09,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:09,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:09,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736681112] [2019-11-20 08:38:09,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:09,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:09,684 INFO L87 Difference]: Start difference. First operand 2235 states and 2837 transitions. Second operand 3 states. [2019-11-20 08:38:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:09,854 INFO L93 Difference]: Finished difference Result 4473 states and 5673 transitions. [2019-11-20 08:38:09,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:09,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-20 08:38:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:09,858 INFO L225 Difference]: With dead ends: 4473 [2019-11-20 08:38:09,858 INFO L226 Difference]: Without dead ends: 2245 [2019-11-20 08:38:09,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-20 08:38:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2235. [2019-11-20 08:38:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-11-20 08:38:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2812 transitions. [2019-11-20 08:38:09,917 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2812 transitions. Word has length 359 [2019-11-20 08:38:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:09,917 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2812 transitions. [2019-11-20 08:38:09,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2812 transitions. [2019-11-20 08:38:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-20 08:38:09,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:09,925 INFO L410 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] [2019-11-20 08:38:09,926 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1924130447, now seen corresponding path program 1 times [2019-11-20 08:38:09,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:09,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163914877] [2019-11-20 08:38:09,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-20 08:38:10,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163914877] [2019-11-20 08:38:10,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317612877] [2019-11-20 08:38:10,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:10,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:10,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-20 08:38:10,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:10,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:10,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119231497] [2019-11-20 08:38:10,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:10,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:10,364 INFO L87 Difference]: Start difference. First operand 2235 states and 2812 transitions. Second operand 3 states. [2019-11-20 08:38:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:10,422 INFO L93 Difference]: Finished difference Result 2854 states and 3617 transitions. [2019-11-20 08:38:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:10,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-20 08:38:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:10,426 INFO L225 Difference]: With dead ends: 2854 [2019-11-20 08:38:10,427 INFO L226 Difference]: Without dead ends: 2762 [2019-11-20 08:38:10,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-11-20 08:38:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2145. [2019-11-20 08:38:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-11-20 08:38:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2711 transitions. [2019-11-20 08:38:10,487 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2711 transitions. Word has length 392 [2019-11-20 08:38:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:10,488 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 2711 transitions. [2019-11-20 08:38:10,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2711 transitions. [2019-11-20 08:38:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-20 08:38:10,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:10,500 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 08:38:10,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:10,704 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:10,705 INFO L82 PathProgramCache]: Analyzing trace with hash -820757555, now seen corresponding path program 1 times [2019-11-20 08:38:10,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:10,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187115639] [2019-11-20 08:38:10,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-11-20 08:38:11,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187115639] [2019-11-20 08:38:11,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400684024] [2019-11-20 08:38:11,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:11,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:11,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-11-20 08:38:11,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:11,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:11,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660520412] [2019-11-20 08:38:11,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:11,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:11,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:11,371 INFO L87 Difference]: Start difference. First operand 2145 states and 2711 transitions. Second operand 4 states. [2019-11-20 08:38:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:11,693 INFO L93 Difference]: Finished difference Result 5211 states and 6595 transitions. [2019-11-20 08:38:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:38:11,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-11-20 08:38:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:11,698 INFO L225 Difference]: With dead ends: 5211 [2019-11-20 08:38:11,698 INFO L226 Difference]: Without dead ends: 3031 [2019-11-20 08:38:11,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2019-11-20 08:38:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2205. [2019-11-20 08:38:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-20 08:38:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2791 transitions. [2019-11-20 08:38:11,765 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2791 transitions. Word has length 532 [2019-11-20 08:38:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:11,765 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 2791 transitions. [2019-11-20 08:38:11,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2791 transitions. [2019-11-20 08:38:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-11-20 08:38:11,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:11,779 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 08:38:11,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:11,983 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash -751360217, now seen corresponding path program 1 times [2019-11-20 08:38:11,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:11,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212108332] [2019-11-20 08:38:11,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-11-20 08:38:12,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212108332] [2019-11-20 08:38:12,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:12,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:12,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622757004] [2019-11-20 08:38:12,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:12,276 INFO L87 Difference]: Start difference. First operand 2205 states and 2791 transitions. Second operand 3 states. [2019-11-20 08:38:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:12,451 INFO L93 Difference]: Finished difference Result 4583 states and 5811 transitions. [2019-11-20 08:38:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:12,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 594 [2019-11-20 08:38:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:12,455 INFO L225 Difference]: With dead ends: 4583 [2019-11-20 08:38:12,456 INFO L226 Difference]: Without dead ends: 2385 [2019-11-20 08:38:12,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-11-20 08:38:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2375. [2019-11-20 08:38:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2019-11-20 08:38:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2986 transitions. [2019-11-20 08:38:12,525 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2986 transitions. Word has length 594 [2019-11-20 08:38:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:12,526 INFO L462 AbstractCegarLoop]: Abstraction has 2375 states and 2986 transitions. [2019-11-20 08:38:12,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2986 transitions. [2019-11-20 08:38:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-11-20 08:38:12,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:12,547 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 08:38:12,547 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:12,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1835833869, now seen corresponding path program 1 times [2019-11-20 08:38:12,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:12,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969400676] [2019-11-20 08:38:12,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-11-20 08:38:12,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969400676] [2019-11-20 08:38:12,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:12,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:12,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649823959] [2019-11-20 08:38:12,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:12,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:12,853 INFO L87 Difference]: Start difference. First operand 2375 states and 2986 transitions. Second operand 3 states. [2019-11-20 08:38:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:13,015 INFO L93 Difference]: Finished difference Result 4738 states and 5951 transitions. [2019-11-20 08:38:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:13,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2019-11-20 08:38:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:13,019 INFO L225 Difference]: With dead ends: 4738 [2019-11-20 08:38:13,019 INFO L226 Difference]: Without dead ends: 2370 [2019-11-20 08:38:13,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-11-20 08:38:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2370. [2019-11-20 08:38:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-11-20 08:38:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2931 transitions. [2019-11-20 08:38:13,080 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2931 transitions. Word has length 656 [2019-11-20 08:38:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:13,080 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 2931 transitions. [2019-11-20 08:38:13,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2931 transitions. [2019-11-20 08:38:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-11-20 08:38:13,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:13,089 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 08:38:13,089 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1388787143, now seen corresponding path program 1 times [2019-11-20 08:38:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227250519] [2019-11-20 08:38:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-11-20 08:38:13,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227250519] [2019-11-20 08:38:13,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534115026] [2019-11-20 08:38:13,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:13,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:13,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-11-20 08:38:14,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:14,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:14,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952383629] [2019-11-20 08:38:14,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:14,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:14,083 INFO L87 Difference]: Start difference. First operand 2370 states and 2931 transitions. Second operand 4 states. [2019-11-20 08:38:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:14,280 INFO L93 Difference]: Finished difference Result 4080 states and 5087 transitions. [2019-11-20 08:38:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:38:14,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 722 [2019-11-20 08:38:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:14,281 INFO L225 Difference]: With dead ends: 4080 [2019-11-20 08:38:14,281 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 08:38:14,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 08:38:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 08:38:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 08:38:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 08:38:14,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 722 [2019-11-20 08:38:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:14,286 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:38:14,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 08:38:14,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 08:38:14,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:14,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 08:38:14,632 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-11-20 08:38:14,908 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 131 [2019-11-20 08:38:16,062 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-11-20 08:38:17,623 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-11-20 08:38:18,226 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-20 08:38:18,744 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-20 08:38:19,191 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 34 [2019-11-20 08:38:20,016 WARN L191 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 49 [2019-11-20 08:38:20,340 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2019-11-20 08:38:20,781 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-11-20 08:38:24,346 WARN L191 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 213 DAG size of output: 111 [2019-11-20 08:38:24,674 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-11-20 08:38:24,877 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-11-20 08:38:25,082 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-20 08:38:25,323 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-20 08:38:25,592 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-20 08:38:25,873 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-20 08:38:26,149 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-20 08:38:26,294 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-11-20 08:38:26,596 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-20 08:38:27,024 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 24 [2019-11-20 08:38:29,952 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 213 DAG size of output: 111 [2019-11-20 08:38:30,255 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-20 08:38:30,536 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 19 [2019-11-20 08:38:30,850 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-11-20 08:38:30,853 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 435) no Hoare annotation was computed. [2019-11-20 08:38:30,853 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 371) no Hoare annotation was computed. [2019-11-20 08:38:30,853 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4))) [2019-11-20 08:38:30,853 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-20 08:38:30,854 INFO L447 ceAbstractionStarter]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-20 08:38:30,854 INFO L440 ceAbstractionStarter]: At program point L400(lines 391 409) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and .cse3 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) .cse3))) [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 370) no Hoare annotation was computed. [2019-11-20 08:38:30,854 INFO L444 ceAbstractionStarter]: For program point L336-1(lines 336 370) no Hoare annotation was computed. [2019-11-20 08:38:30,855 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 08:38:30,855 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-20 08:38:30,855 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and .cse9 (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7))) [2019-11-20 08:38:30,855 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 471) no Hoare annotation was computed. [2019-11-20 08:38:30,855 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-11-20 08:38:30,855 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 367) no Hoare annotation was computed. [2019-11-20 08:38:30,855 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 08:38:30,855 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-20 08:38:30,855 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 314) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-20 08:38:30,856 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-20 08:38:30,857 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 365) no Hoare annotation was computed. [2019-11-20 08:38:30,857 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-20 08:38:30,857 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 577) 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 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10))) [2019-11-20 08:38:30,857 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-20 08:38:30,857 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4) .cse5) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5))) [2019-11-20 08:38:30,857 INFO L447 ceAbstractionStarter]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-20 08:38:30,858 INFO L440 ceAbstractionStarter]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse17 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (let ((.cse7 (and .cse0 .cse20 .cse21 .cse30 .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (and .cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse20 .cse21 .cse30 .cse26)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse16 (and .cse19 .cse20 .cse21 .cse30 .cse26)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse18 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not .cse3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3) (and .cse9 .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse14 .cse15) (and .cse8 .cse16) (and .cse9 .cse17 .cse11 .cse4) (and .cse10 .cse4 .cse5 .cse15 .cse13) (and .cse1 (and .cse9 .cse10 .cse11 .cse4 .cse12)) (and (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse2) (and .cse19 .cse26 .cse27) (and (and .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse25) .cse2) (and .cse17 .cse26 .cse27) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse3) (and .cse28 .cse8) (and .cse0 .cse3 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse3) (and .cse6 .cse28) (and .cse0 .cse26 .cse27 .cse13) (and .cse0 .cse4 .cse5 .cse13) (and .cse6 .cse16) (and .cse0 .cse14) (and .cse9 .cse11 .cse4 .cse19) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18 .cse15 .cse29 .cse13) (and .cse1 .cse19 .cse2) (and .cse1 .cse17 .cse2) (and .cse10 .cse18 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse29) (and .cse0 .cse1 .cse26 .cse27) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse3) (and .cse15 .cse26 .cse27 .cse13)))) [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 445) no Hoare annotation was computed. [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-20 08:38:30,858 INFO L444 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 411) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 455) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 386) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-20 08:38:30,859 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L440 ceAbstractionStarter]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-20 08:38:30,860 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2019-11-20 08:38:30,860 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5)) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0))) [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-20 08:38:30,860 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 452) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-20 08:38:30,861 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 361) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L444 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-20 08:38:30,862 INFO L440 ceAbstractionStarter]: At program point L354(lines 330 372) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5)) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0))) [2019-11-20 08:38:30,863 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) (and .cse0 .cse1 .cse2 .cse3) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3))) [2019-11-20 08:38:30,863 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and .cse3 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) .cse3))) [2019-11-20 08:38:30,863 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-20 08:38:30,863 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-20 08:38:30,863 INFO L444 ceAbstractionStarter]: For program point L421(lines 421 423) no Hoare annotation was computed. [2019-11-20 08:38:30,863 INFO L440 ceAbstractionStarter]: At program point L388(lines 379 411) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and .cse3 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) .cse3))) [2019-11-20 08:38:30,863 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-11-20 08:38:30,863 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 08:38:30,863 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 207 541) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L447 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L324-2(lines 207 541) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-20 08:38:30,864 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 409) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-20 08:38:30,865 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and .cse0 .cse1 .cse2 .cse3)))) [2019-11-20 08:38:30,868 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse1 .cse2 .cse3))) [2019-11-20 08:38:30,868 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-20 08:38:30,868 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 300) no Hoare annotation was computed. [2019-11-20 08:38:30,869 INFO L444 ceAbstractionStarter]: For program point L296-2(lines 296 300) no Hoare annotation was computed. [2019-11-20 08:38:30,869 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-20 08:38:30,869 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-20 08:38:30,869 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-20 08:38:30,870 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse17 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (let ((.cse7 (and .cse0 .cse20 .cse21 .cse30 .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (and .cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse20 .cse21 .cse30 .cse26)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse16 (and .cse19 .cse20 .cse21 .cse30 .cse26)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse18 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not .cse3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3) (and .cse9 .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse14 .cse15) (and .cse8 .cse16) (and .cse9 .cse17 .cse11 .cse4) (and .cse10 .cse4 .cse5 .cse15 .cse13) (and .cse1 (and .cse9 .cse10 .cse11 .cse4 .cse12)) (and (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse2) (and .cse19 .cse26 .cse27) (and (and .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse25) .cse2) (and .cse17 .cse26 .cse27) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse3) (and .cse28 .cse8) (and .cse0 .cse3 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse3) (and .cse6 .cse28) (and .cse0 .cse26 .cse27 .cse13) (and .cse0 .cse4 .cse5 .cse13) (and .cse6 .cse16) (and .cse0 .cse14) (and .cse9 .cse11 .cse4 .cse19) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18 .cse15 .cse29 .cse13) (and .cse1 .cse19 .cse2) (and .cse1 .cse17 .cse2) (and .cse10 .cse18 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse29) (and .cse0 .cse1 .cse26 .cse27) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse3) (and .cse15 .cse26 .cse27 .cse13)))) [2019-11-20 08:38:30,870 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-20 08:38:30,870 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 429 437) no Hoare annotation was computed. [2019-11-20 08:38:30,870 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-20 08:38:30,870 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse3 .cse1 .cse2))) [2019-11-20 08:38:30,871 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) .cse9) (and (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) .cse9))) [2019-11-20 08:38:30,871 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 08:38:30,871 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-20 08:38:30,871 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-20 08:38:30,871 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-20 08:38:30,871 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 207 541) no Hoare annotation was computed. [2019-11-20 08:38:30,872 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-20 08:38:30,872 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-20 08:38:30,872 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-20 08:38:30,872 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-20 08:38:30,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:38:30 BoogieIcfgContainer [2019-11-20 08:38:30,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 08:38:30,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:38:30,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:38:30,916 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:38:30,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:55" (3/4) ... [2019-11-20 08:38:30,920 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 08:38:30,936 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 08:38:30,937 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 08:38:31,048 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_11f3bb02-c170-4522-8cc7-e4b9762fc118/bin/uautomizer/witness.graphml [2019-11-20 08:38:31,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:38:31,049 INFO L168 Benchmark]: Toolchain (without parser) took 37209.92 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 950.1 MB in the beginning and 1.7 GB in the end (delta: -742.1 MB). Peak memory consumption was 807.7 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:31,049 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:38:31,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:31,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:31,050 INFO L168 Benchmark]: Boogie Preprocessor took 41.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:38:31,051 INFO L168 Benchmark]: RCFGBuilder took 821.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:31,051 INFO L168 Benchmark]: TraceAbstraction took 35658.50 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -666.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 08:38:31,051 INFO L168 Benchmark]: Witness Printer took 132.08 ms. Allocated memory is still 2.6 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-20 08:38:31,053 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 486.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 821.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35658.50 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -666.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 132.08 ms. Allocated memory is still 2.6 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) || (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((s__state <= 8576 && ((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) || (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) || ((s__s3__tmp__next_state___0 <= 8576 && (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) && 0 == s__hit)) || ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2 && (((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) && 0 == s__hit) || ((s__s3__tmp__next_state___0 <= 8576 && ((((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && ((((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 3 && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && !(s__state == 8656)) && !(0 == s__hit)) || ((((!(s__state == 8657) && 8656 <= s__state) && blastFlag == 1) && !(s__state == 12292)) && !(s__state == 8656))) || ((((0 == blastFlag && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && !(s__state == 8656))) || (((((blastFlag <= 3 && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && s__state <= 8576) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit)) || ((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 8608 == s__state) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656)) && !(0 == s__hit))) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (8608 == s__state && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit))) || (s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656))) || ((((((((8448 <= s__state && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && s__state <= 8576)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || (((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((0 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 8608 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 8560 == s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || (s__state == 8592 && ((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(0 == s__hit))) || (s__state == 8592 && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (blastFlag <= 2 && s__state <= 3)) || (((s__state <= 8672 && !(s__state == 8657)) && 8656 <= s__state) && blastFlag == 1)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) && 0 == s__hit) || ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((blastFlag == 1 && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) || ((((0 == blastFlag && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576)) || (((((blastFlag <= 2 && !(s__state == 8545)) && 0 == s__hit) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) || ((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576)) || ((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) || ((s__state <= 8576 && ((blastFlag <= 2 && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && 0 == s__hit)) || ((((!(s__state == 8560) && blastFlag == 1) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8656 <= s__state)) || (((s__state <= 8672 && !(s__state == 8672)) && 8656 <= s__state) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8576 && ((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) || ((s__state <= 8576 && ((blastFlag <= 2 && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && 0 == s__hit)) || ((((!(s__state == 8560) && blastFlag == 1) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((0 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) || (((8448 <= s__state && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((blastFlag <= 2 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) || ((s__state <= 8576 && ((blastFlag <= 2 && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && 0 == s__hit)) || ((((!(s__state == 8560) && blastFlag == 1) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((0 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 8608 == s__state) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656)) && !(0 == s__hit))) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (8608 == s__state && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit))) || (s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656))) || ((((((((8448 <= s__state && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && s__state <= 8576)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || (((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((0 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 8608 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 8560 == s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || (s__state == 8592 && ((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(0 == s__hit))) || (s__state == 8592 && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (blastFlag <= 2 && s__state <= 3)) || (((s__state <= 8672 && !(s__state == 8657)) && 8656 <= s__state) && blastFlag == 1)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 8576 && ((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) || (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 8608 == s__state) && blastFlag <= 2) && 0 == s__hit) || (0 == blastFlag && 8608 == s__state)) || (8608 == s__state && blastFlag == 1) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || (((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 35.5s, OverallIterations: 39, TraceHistogramMax: 24, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.3s, HoareTripleCheckerStatistics: 7340 SDtfs, 4454 SDslu, 3443 SDs, 0 SdLazy, 3925 SolverSat, 1034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3099 GetRequests, 3043 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5034occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 6479 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2709 HoareAnnotationTreeSize, 28 FomulaSimplifications, 258012 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 105745 FormulaSimplificationTreeSizeReductionInter, 13.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 11530 NumberOfCodeBlocks, 11530 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11483 ConstructedInterpolants, 0 QuantifiedInterpolants, 5269159 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4812 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...