./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:04,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:04,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:04,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:04,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:04,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:04,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:04,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:04,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:04,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:04,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:04,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:04,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:04,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:04,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:04,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:04,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:04,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:04,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:04,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:04,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:04,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:04,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:04,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:04,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:04,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:04,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:04,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:04,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:04,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:04,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:04,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:04,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:04,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:04,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:04,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:04,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:04,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:04,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:04,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:04,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:04,780 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:04,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:04,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:04,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:04,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:04,792 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:04,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:04,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:04,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:04,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:04,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:04,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:04,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:04,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:04,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:04,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:04,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:04,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:04,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:04,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:04,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:04,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:04,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:04,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:04,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:04,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:04,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:04,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:04,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:04,796 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/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-10-22 08:57:04,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:04,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:04,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:04,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:04,854 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:04,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-10-22 08:57:04,898 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/data/ef7ee584a/4f5ade41ff3e436cbf2d8991599ece55/FLAG988798035 [2019-10-22 08:57:05,376 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:05,385 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-10-22 08:57:05,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/data/ef7ee584a/4f5ade41ff3e436cbf2d8991599ece55/FLAG988798035 [2019-10-22 08:57:05,876 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/data/ef7ee584a/4f5ade41ff3e436cbf2d8991599ece55 [2019-10-22 08:57:05,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:05,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:05,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:05,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:05,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:05,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:05" (1/1) ... [2019-10-22 08:57:05,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538b3fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:05, skipping insertion in model container [2019-10-22 08:57:05,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:05" (1/1) ... [2019-10-22 08:57:05,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:05,945 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:06,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:06,221 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:06,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:06,284 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:06,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06 WrapperNode [2019-10-22 08:57:06,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:06,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:06,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:06,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:06,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:06,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:06,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:06,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:06,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... [2019-10-22 08:57:06,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:06,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:06,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:06,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:06,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:06,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:06,518 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:07,007 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:57:07,008 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:57:07,009 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:07,010 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:57:07,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:07 BoogieIcfgContainer [2019-10-22 08:57:07,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:07,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:07,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:07,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:07,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:05" (1/3) ... [2019-10-22 08:57:07,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14db770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:07, skipping insertion in model container [2019-10-22 08:57:07,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:06" (2/3) ... [2019-10-22 08:57:07,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14db770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:07, skipping insertion in model container [2019-10-22 08:57:07,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:07" (3/3) ... [2019-10-22 08:57:07,019 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-10-22 08:57:07,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:07,036 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:57:07,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:57:07,075 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:07,076 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:07,076 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:07,076 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:07,076 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:07,076 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:07,076 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:07,076 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-10-22 08:57:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 08:57:07,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:07,104 INFO L380 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-10-22 08:57:07,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-10-22 08:57:07,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:07,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130519482] [2019-10-22 08:57:07,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:07,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130519482] [2019-10-22 08:57:07,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:07,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:07,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936748768] [2019-10-22 08:57:07,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:07,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:07,335 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-10-22 08:57:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:07,564 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-10-22 08:57:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:07,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 08:57:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:07,576 INFO L225 Difference]: With dead ends: 322 [2019-10-22 08:57:07,577 INFO L226 Difference]: Without dead ends: 170 [2019-10-22 08:57:07,580 INFO L600 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-10-22 08:57:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-22 08:57:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-10-22 08:57:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 08:57:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-10-22 08:57:07,627 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-10-22 08:57:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:07,627 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-10-22 08:57:07,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-10-22 08:57:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:57:07,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:07,630 INFO L380 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-10-22 08:57:07,630 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-10-22 08:57:07,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:07,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223548695] [2019-10-22 08:57:07,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:07,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223548695] [2019-10-22 08:57:07,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:07,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:07,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331503800] [2019-10-22 08:57:07,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:07,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:07,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:07,723 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-10-22 08:57:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:07,901 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-10-22 08:57:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:07,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 08:57:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:07,903 INFO L225 Difference]: With dead ends: 371 [2019-10-22 08:57:07,903 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 08:57:07,904 INFO L600 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-10-22 08:57:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 08:57:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-22 08:57:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 08:57:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-10-22 08:57:07,918 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-10-22 08:57:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:07,918 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-10-22 08:57:07,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-10-22 08:57:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 08:57:07,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:07,921 INFO L380 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-10-22 08:57:07,921 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-10-22 08:57:07,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:07,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116599761] [2019-10-22 08:57:07,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:07,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:07,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116599761] [2019-10-22 08:57:07,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:07,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:07,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051412501] [2019-10-22 08:57:07,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:07,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:07,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:07,975 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-10-22 08:57:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,162 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-10-22 08:57:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:08,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 08:57:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,165 INFO L225 Difference]: With dead ends: 436 [2019-10-22 08:57:08,166 INFO L226 Difference]: Without dead ends: 237 [2019-10-22 08:57:08,166 INFO L600 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-10-22 08:57:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-22 08:57:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-10-22 08:57:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-22 08:57:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-10-22 08:57:08,190 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-10-22 08:57:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,191 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-10-22 08:57:08,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-10-22 08:57:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 08:57:08,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,194 INFO L380 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-10-22 08:57:08,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-10-22 08:57:08,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524928238] [2019-10-22 08:57:08,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:08,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524928238] [2019-10-22 08:57:08,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:08,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812878277] [2019-10-22 08:57:08,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:08,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:08,261 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-10-22 08:57:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,394 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-10-22 08:57:08,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:08,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 08:57:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,396 INFO L225 Difference]: With dead ends: 484 [2019-10-22 08:57:08,397 INFO L226 Difference]: Without dead ends: 254 [2019-10-22 08:57:08,398 INFO L600 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-10-22 08:57:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-22 08:57:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-10-22 08:57:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 08:57:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-10-22 08:57:08,422 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-10-22 08:57:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,423 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-10-22 08:57:08,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-10-22 08:57:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 08:57:08,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,430 INFO L380 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-10-22 08:57:08,430 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-10-22 08:57:08,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625893326] [2019-10-22 08:57:08,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:08,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625893326] [2019-10-22 08:57:08,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:08,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551333351] [2019-10-22 08:57:08,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:08,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:08,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:08,504 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-10-22 08:57:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,645 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-10-22 08:57:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:08,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 08:57:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,647 INFO L225 Difference]: With dead ends: 543 [2019-10-22 08:57:08,647 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 08:57:08,648 INFO L600 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-10-22 08:57:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 08:57:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-10-22 08:57:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-22 08:57:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-10-22 08:57:08,659 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-10-22 08:57:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,659 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-10-22 08:57:08,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-10-22 08:57:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:57:08,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,661 INFO L380 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-10-22 08:57:08,661 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-10-22 08:57:08,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759466548] [2019-10-22 08:57:08,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:08,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759466548] [2019-10-22 08:57:08,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:08,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344378157] [2019-10-22 08:57:08,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:08,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:08,694 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-10-22 08:57:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:08,799 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-10-22 08:57:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:08,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:57:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:08,801 INFO L225 Difference]: With dead ends: 583 [2019-10-22 08:57:08,801 INFO L226 Difference]: Without dead ends: 296 [2019-10-22 08:57:08,802 INFO L600 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-10-22 08:57:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-22 08:57:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-10-22 08:57:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-22 08:57:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-10-22 08:57:08,811 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-10-22 08:57:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:08,812 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-10-22 08:57:08,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-10-22 08:57:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:57:08,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:08,813 INFO L380 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-10-22 08:57:08,813 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-10-22 08:57:08,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:08,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083560517] [2019-10-22 08:57:08,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:08,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:08,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083560517] [2019-10-22 08:57:08,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:08,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:08,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547246602] [2019-10-22 08:57:08,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:08,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:08,868 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-10-22 08:57:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:09,017 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-10-22 08:57:09,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:09,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:57:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:09,019 INFO L225 Difference]: With dead ends: 585 [2019-10-22 08:57:09,019 INFO L226 Difference]: Without dead ends: 296 [2019-10-22 08:57:09,020 INFO L600 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-10-22 08:57:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-22 08:57:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-22 08:57:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-22 08:57:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-10-22 08:57:09,033 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-10-22 08:57:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:09,034 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-10-22 08:57:09,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-10-22 08:57:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 08:57:09,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:09,036 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:09,036 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-10-22 08:57:09,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:09,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873014470] [2019-10-22 08:57:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:57:09,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873014470] [2019-10-22 08:57:09,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:09,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:09,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476637616] [2019-10-22 08:57:09,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:09,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:09,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:09,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:09,067 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-10-22 08:57:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:09,171 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-10-22 08:57:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:09,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-22 08:57:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:09,172 INFO L225 Difference]: With dead ends: 585 [2019-10-22 08:57:09,173 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 08:57:09,173 INFO L600 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-10-22 08:57:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 08:57:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-10-22 08:57:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-22 08:57:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-10-22 08:57:09,183 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-10-22 08:57:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:09,183 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-10-22 08:57:09,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-10-22 08:57:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:57:09,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:09,184 INFO L380 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-10-22 08:57:09,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-10-22 08:57:09,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:09,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97351539] [2019-10-22 08:57:09,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:09,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97351539] [2019-10-22 08:57:09,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:09,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:09,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88235504] [2019-10-22 08:57:09,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:09,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:09,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:09,217 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-10-22 08:57:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:09,344 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-10-22 08:57:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:09,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 08:57:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:09,346 INFO L225 Difference]: With dead ends: 624 [2019-10-22 08:57:09,346 INFO L226 Difference]: Without dead ends: 331 [2019-10-22 08:57:09,347 INFO L600 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-10-22 08:57:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-10-22 08:57:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-10-22 08:57:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 08:57:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-10-22 08:57:09,357 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-10-22 08:57:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:09,357 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-10-22 08:57:09,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-10-22 08:57:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:57:09,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:09,359 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:09,359 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-10-22 08:57:09,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:09,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725959819] [2019-10-22 08:57:09,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:09,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725959819] [2019-10-22 08:57:09,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:09,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:09,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146068471] [2019-10-22 08:57:09,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:09,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:09,415 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-10-22 08:57:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:09,548 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-10-22 08:57:09,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:09,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 08:57:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:09,550 INFO L225 Difference]: With dead ends: 685 [2019-10-22 08:57:09,550 INFO L226 Difference]: Without dead ends: 363 [2019-10-22 08:57:09,551 INFO L600 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-10-22 08:57:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-22 08:57:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-10-22 08:57:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 08:57:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-10-22 08:57:09,561 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-10-22 08:57:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:09,562 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-10-22 08:57:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-10-22 08:57:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:57:09,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:09,563 INFO L380 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-10-22 08:57:09,563 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-10-22 08:57:09,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:09,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124764244] [2019-10-22 08:57:09,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:09,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124764244] [2019-10-22 08:57:09,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:09,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:09,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476319352] [2019-10-22 08:57:09,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:09,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:09,590 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-10-22 08:57:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:09,727 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-10-22 08:57:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:09,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 08:57:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:09,729 INFO L225 Difference]: With dead ends: 707 [2019-10-22 08:57:09,730 INFO L226 Difference]: Without dead ends: 358 [2019-10-22 08:57:09,730 INFO L600 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-10-22 08:57:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-22 08:57:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-10-22 08:57:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 08:57:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-10-22 08:57:09,742 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-10-22 08:57:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:09,742 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-10-22 08:57:09,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-10-22 08:57:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:57:09,743 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:09,743 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:09,744 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-10-22 08:57:09,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:09,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530614133] [2019-10-22 08:57:09,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:57:09,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530614133] [2019-10-22 08:57:09,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:09,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:09,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3220640] [2019-10-22 08:57:09,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:09,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:09,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:09,780 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-10-22 08:57:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:09,911 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-10-22 08:57:09,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:09,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:57:09,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:09,914 INFO L225 Difference]: With dead ends: 712 [2019-10-22 08:57:09,914 INFO L226 Difference]: Without dead ends: 363 [2019-10-22 08:57:09,914 INFO L600 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-10-22 08:57:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-22 08:57:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-10-22 08:57:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 08:57:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-10-22 08:57:09,927 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-10-22 08:57:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:09,927 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-10-22 08:57:09,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-10-22 08:57:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 08:57:09,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:09,928 INFO L380 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-10-22 08:57:09,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-10-22 08:57:09,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:09,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914119642] [2019-10-22 08:57:09,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:09,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:09,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914119642] [2019-10-22 08:57:09,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:09,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:09,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108302876] [2019-10-22 08:57:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:09,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:09,956 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-10-22 08:57:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:10,070 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-10-22 08:57:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:10,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 08:57:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:10,073 INFO L225 Difference]: With dead ends: 730 [2019-10-22 08:57:10,073 INFO L226 Difference]: Without dead ends: 381 [2019-10-22 08:57:10,074 INFO L600 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-10-22 08:57:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-22 08:57:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-10-22 08:57:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-22 08:57:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-10-22 08:57:10,086 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-10-22 08:57:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:10,086 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-10-22 08:57:10,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-10-22 08:57:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 08:57:10,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:10,088 INFO L380 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-10-22 08:57:10,088 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-10-22 08:57:10,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:10,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874756894] [2019-10-22 08:57:10,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:10,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874756894] [2019-10-22 08:57:10,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:10,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:10,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782564855] [2019-10-22 08:57:10,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:10,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:10,114 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-10-22 08:57:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:10,242 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-10-22 08:57:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:10,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 08:57:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:10,244 INFO L225 Difference]: With dead ends: 751 [2019-10-22 08:57:10,244 INFO L226 Difference]: Without dead ends: 381 [2019-10-22 08:57:10,245 INFO L600 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-10-22 08:57:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-22 08:57:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-10-22 08:57:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-22 08:57:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-10-22 08:57:10,258 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-10-22 08:57:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:10,258 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-10-22 08:57:10,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-10-22 08:57:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-22 08:57:10,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:10,260 INFO L380 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-10-22 08:57:10,260 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-10-22 08:57:10,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:10,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008155789] [2019-10-22 08:57:10,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:57:10,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008155789] [2019-10-22 08:57:10,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:10,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:10,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130490269] [2019-10-22 08:57:10,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:10,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:10,311 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-10-22 08:57:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:10,352 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-10-22 08:57:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:10,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-22 08:57:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:10,356 INFO L225 Difference]: With dead ends: 747 [2019-10-22 08:57:10,356 INFO L226 Difference]: Without dead ends: 745 [2019-10-22 08:57:10,356 INFO L600 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-10-22 08:57:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-10-22 08:57:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-10-22 08:57:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-10-22 08:57:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-10-22 08:57:10,382 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-10-22 08:57:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:10,382 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-10-22 08:57:10,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-10-22 08:57:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 08:57:10,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:10,384 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:10,384 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-10-22 08:57:10,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:10,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358080246] [2019-10-22 08:57:10,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:10,394 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:10,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588996720] [2019-10-22 08:57:10,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:10,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:10,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:10,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358080246] [2019-10-22 08:57:10,512 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:10,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588996720] [2019-10-22 08:57:10,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:10,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:10,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487903773] [2019-10-22 08:57:10,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:10,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:10,515 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-10-22 08:57:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:10,592 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-10-22 08:57:10,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:10,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-22 08:57:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:10,597 INFO L225 Difference]: With dead ends: 1851 [2019-10-22 08:57:10,597 INFO L226 Difference]: Without dead ends: 1113 [2019-10-22 08:57:10,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-22 08:57:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-10-22 08:57:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-10-22 08:57:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-10-22 08:57:10,644 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-10-22 08:57:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-10-22 08:57:10,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-10-22 08:57:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-22 08:57:10,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:10,648 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:10,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:10,849 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-10-22 08:57:10,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:10,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647769587] [2019-10-22 08:57:10,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:10,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:10,859 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:10,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528656840] [2019-10-22 08:57:10,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:10,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:10,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:57:10,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647769587] [2019-10-22 08:57:10,960 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:10,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528656840] [2019-10-22 08:57:10,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:10,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:10,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267724685] [2019-10-22 08:57:10,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:10,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:10,962 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-10-22 08:57:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,023 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-10-22 08:57:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-22 08:57:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,029 INFO L225 Difference]: With dead ends: 2219 [2019-10-22 08:57:11,029 INFO L226 Difference]: Without dead ends: 1481 [2019-10-22 08:57:11,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-10-22 08:57:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-10-22 08:57:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-22 08:57:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-10-22 08:57:11,086 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-10-22 08:57:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:11,086 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-10-22 08:57:11,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-10-22 08:57:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-22 08:57:11,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:11,091 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:11,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:11,292 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-10-22 08:57:11,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:11,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240447993] [2019-10-22 08:57:11,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-22 08:57:11,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240447993] [2019-10-22 08:57:11,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:11,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:11,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384730741] [2019-10-22 08:57:11,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:11,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,351 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-10-22 08:57:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,525 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-10-22 08:57:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-22 08:57:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,532 INFO L225 Difference]: With dead ends: 3059 [2019-10-22 08:57:11,532 INFO L226 Difference]: Without dead ends: 1585 [2019-10-22 08:57:11,534 INFO L600 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-10-22 08:57:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-22 08:57:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-10-22 08:57:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-22 08:57:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-10-22 08:57:11,592 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-10-22 08:57:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:11,593 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-10-22 08:57:11,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-10-22 08:57:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-22 08:57:11,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:11,597 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:11,598 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-10-22 08:57:11,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:11,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745942008] [2019-10-22 08:57:11,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:11,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:11,608 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:11,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822661634] [2019-10-22 08:57:11,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:11,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:11,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:57:11,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745942008] [2019-10-22 08:57:11,704 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:11,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822661634] [2019-10-22 08:57:11,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:11,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:11,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367751763] [2019-10-22 08:57:11,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:11,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,706 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-10-22 08:57:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:11,783 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-10-22 08:57:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:11,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-22 08:57:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:11,791 INFO L225 Difference]: With dead ends: 3139 [2019-10-22 08:57:11,791 INFO L226 Difference]: Without dead ends: 1964 [2019-10-22 08:57:11,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-10-22 08:57:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-10-22 08:57:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-10-22 08:57:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-10-22 08:57:11,900 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-10-22 08:57:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:11,900 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-10-22 08:57:11,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-10-22 08:57:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-22 08:57:11,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:11,906 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:12,107 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-10-22 08:57:12,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412747607] [2019-10-22 08:57:12,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,126 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:12,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319843408] [2019-10-22 08:57:12,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:12,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-22 08:57:12,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412747607] [2019-10-22 08:57:12,240 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:12,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319843408] [2019-10-22 08:57:12,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143038321] [2019-10-22 08:57:12,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,242 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-10-22 08:57:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:12,370 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-10-22 08:57:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:12,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-22 08:57:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:12,382 INFO L225 Difference]: With dead ends: 5743 [2019-10-22 08:57:12,382 INFO L226 Difference]: Without dead ends: 3786 [2019-10-22 08:57:12,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-22 08:57:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-22 08:57:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:57:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-10-22 08:57:12,520 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-10-22 08:57:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:12,521 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-10-22 08:57:12,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-10-22 08:57:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-22 08:57:12,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:12,529 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:12,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:12,730 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-10-22 08:57:12,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:12,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884245800] [2019-10-22 08:57:12,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:12,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:12,742 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:12,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721781286] [2019-10-22 08:57:12,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:12,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:12,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-22 08:57:12,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884245800] [2019-10-22 08:57:12,868 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:12,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721781286] [2019-10-22 08:57:12,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:12,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:12,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226879224] [2019-10-22 08:57:12,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:12,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:12,870 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-10-22 08:57:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:13,144 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-10-22 08:57:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:13,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-22 08:57:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:13,158 INFO L225 Difference]: With dead ends: 7651 [2019-10-22 08:57:13,158 INFO L226 Difference]: Without dead ends: 3874 [2019-10-22 08:57:13,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-10-22 08:57:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-10-22 08:57:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:57:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-10-22 08:57:13,347 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-10-22 08:57:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:13,348 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-10-22 08:57:13,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-10-22 08:57:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-22 08:57:13,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:13,355 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:13,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:13,556 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:13,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:13,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-10-22 08:57:13,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:13,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422975261] [2019-10-22 08:57:13,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-10-22 08:57:13,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422975261] [2019-10-22 08:57:13,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:13,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:13,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376310551] [2019-10-22 08:57:13,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:13,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:13,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:13,621 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-10-22 08:57:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:13,837 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-10-22 08:57:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:13,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-22 08:57:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:13,851 INFO L225 Difference]: With dead ends: 7683 [2019-10-22 08:57:13,851 INFO L226 Difference]: Without dead ends: 3906 [2019-10-22 08:57:13,856 INFO L600 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-10-22 08:57:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-10-22 08:57:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-10-22 08:57:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:57:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-10-22 08:57:13,988 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-10-22 08:57:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:13,988 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-10-22 08:57:13,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-10-22 08:57:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-22 08:57:13,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:13,996 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:13,997 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:13,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-10-22 08:57:13,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:13,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25822277] [2019-10-22 08:57:13,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:13,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:14,010 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:14,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120031209] [2019-10-22 08:57:14,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:14,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:14,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-22 08:57:14,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25822277] [2019-10-22 08:57:14,132 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:14,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120031209] [2019-10-22 08:57:14,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:14,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:14,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975860006] [2019-10-22 08:57:14,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:14,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:14,134 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-10-22 08:57:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:14,375 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-10-22 08:57:14,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:14,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-10-22 08:57:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:14,398 INFO L225 Difference]: With dead ends: 7561 [2019-10-22 08:57:14,404 INFO L226 Difference]: Without dead ends: 3784 [2019-10-22 08:57:14,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:14,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-10-22 08:57:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-10-22 08:57:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:57:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-10-22 08:57:14,526 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-10-22 08:57:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:14,526 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-10-22 08:57:14,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-10-22 08:57:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-22 08:57:14,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:14,535 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:14,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:14,736 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-10-22 08:57:14,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:14,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348426744] [2019-10-22 08:57:14,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:14,750 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:57:14,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053353840] [2019-10-22 08:57:14,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:14,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:14,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-22 08:57:14,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348426744] [2019-10-22 08:57:14,883 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:57:14,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053353840] [2019-10-22 08:57:14,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:14,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:14,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227642533] [2019-10-22 08:57:14,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:14,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:14,886 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-10-22 08:57:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:15,104 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-10-22 08:57:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:15,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-22 08:57:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:15,110 INFO L225 Difference]: With dead ends: 7951 [2019-10-22 08:57:15,110 INFO L226 Difference]: Without dead ends: 2307 [2019-10-22 08:57:15,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-10-22 08:57:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-10-22 08:57:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-10-22 08:57:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-10-22 08:57:15,189 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-10-22 08:57:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:15,189 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-10-22 08:57:15,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-10-22 08:57:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-22 08:57:15,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:15,195 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:15,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:15,396 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-10-22 08:57:15,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353893163] [2019-10-22 08:57:15,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-22 08:57:15,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353893163] [2019-10-22 08:57:15,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:15,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:15,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322519161] [2019-10-22 08:57:15,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:15,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:15,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:15,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:15,492 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-10-22 08:57:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:15,666 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-10-22 08:57:15,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:15,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-22 08:57:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:15,671 INFO L225 Difference]: With dead ends: 4829 [2019-10-22 08:57:15,671 INFO L226 Difference]: Without dead ends: 2529 [2019-10-22 08:57:15,674 INFO L600 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-10-22 08:57:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-10-22 08:57:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-10-22 08:57:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-10-22 08:57:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-10-22 08:57:15,756 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-10-22 08:57:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:15,756 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-10-22 08:57:15,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-10-22 08:57:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-22 08:57:15,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:15,765 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:15,765 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:15,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,765 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-10-22 08:57:15,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347100928] [2019-10-22 08:57:15,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-10-22 08:57:15,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347100928] [2019-10-22 08:57:15,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:15,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:15,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708334124] [2019-10-22 08:57:15,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:15,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:15,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:15,927 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-10-22 08:57:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:16,079 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-10-22 08:57:16,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:16,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-10-22 08:57:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:16,085 INFO L225 Difference]: With dead ends: 4949 [2019-10-22 08:57:16,085 INFO L226 Difference]: Without dead ends: 2499 [2019-10-22 08:57:16,088 INFO L600 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-10-22 08:57:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-10-22 08:57:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-10-22 08:57:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-10-22 08:57:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-10-22 08:57:16,155 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-10-22 08:57:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:16,156 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-10-22 08:57:16,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-10-22 08:57:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-22 08:57:16,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:16,163 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:16,163 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-10-22 08:57:16,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:16,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54892151] [2019-10-22 08:57:16,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:16,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:16,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-22 08:57:16,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54892151] [2019-10-22 08:57:16,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471705880] [2019-10-22 08:57:16,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/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-10-22 08:57:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:16,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:16,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-22 08:57:16,490 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:16,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:16,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644655428] [2019-10-22 08:57:16,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:16,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:16,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:16,492 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-10-22 08:57:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:16,852 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-10-22 08:57:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:16,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-10-22 08:57:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:16,860 INFO L225 Difference]: With dead ends: 6557 [2019-10-22 08:57:16,860 INFO L226 Difference]: Without dead ends: 3975 [2019-10-22 08:57:16,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-10-22 08:57:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-10-22 08:57:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-10-22 08:57:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-10-22 08:57:16,965 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-10-22 08:57:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:16,965 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-10-22 08:57:16,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-10-22 08:57:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-10-22 08:57:16,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:16,973 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:17,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:17,175 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-10-22 08:57:17,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:17,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860783164] [2019-10-22 08:57:17,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:17,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:17,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-10-22 08:57:17,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860783164] [2019-10-22 08:57:17,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:17,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:17,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004780002] [2019-10-22 08:57:17,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:17,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:17,320 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-10-22 08:57:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:17,489 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-10-22 08:57:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:17,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-10-22 08:57:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:17,494 INFO L225 Difference]: With dead ends: 5073 [2019-10-22 08:57:17,494 INFO L226 Difference]: Without dead ends: 2546 [2019-10-22 08:57:17,497 INFO L600 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-10-22 08:57:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-10-22 08:57:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-10-22 08:57:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-10-22 08:57:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-10-22 08:57:17,566 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-10-22 08:57:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:17,566 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-10-22 08:57:17,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-10-22 08:57:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-10-22 08:57:17,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:17,575 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:17,576 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-10-22 08:57:17,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:17,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464754655] [2019-10-22 08:57:17,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:17,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:17,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-10-22 08:57:17,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464754655] [2019-10-22 08:57:17,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:17,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:17,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518521128] [2019-10-22 08:57:17,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:17,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:17,808 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-10-22 08:57:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:17,972 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-10-22 08:57:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:17,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-10-22 08:57:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:17,977 INFO L225 Difference]: With dead ends: 5277 [2019-10-22 08:57:17,977 INFO L226 Difference]: Without dead ends: 2750 [2019-10-22 08:57:17,980 INFO L600 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-10-22 08:57:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-10-22 08:57:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-10-22 08:57:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-10-22 08:57:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-10-22 08:57:18,050 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-10-22 08:57:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:18,051 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-10-22 08:57:18,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-10-22 08:57:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-10-22 08:57:18,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:18,061 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:18,062 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-10-22 08:57:18,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:18,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089551378] [2019-10-22 08:57:18,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:18,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:18,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-10-22 08:57:18,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089551378] [2019-10-22 08:57:18,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:18,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:18,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404640974] [2019-10-22 08:57:18,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:18,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:18,248 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-10-22 08:57:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:18,427 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-10-22 08:57:18,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:18,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-10-22 08:57:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:18,432 INFO L225 Difference]: With dead ends: 5697 [2019-10-22 08:57:18,433 INFO L226 Difference]: Without dead ends: 2966 [2019-10-22 08:57:18,436 INFO L600 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-10-22 08:57:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-10-22 08:57:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-10-22 08:57:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-10-22 08:57:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-10-22 08:57:18,506 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-10-22 08:57:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:18,506 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-10-22 08:57:18,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-10-22 08:57:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-10-22 08:57:18,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:18,520 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:18,520 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-10-22 08:57:18,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:18,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191812383] [2019-10-22 08:57:18,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:18,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:18,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-22 08:57:18,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191812383] [2019-10-22 08:57:18,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150487867] [2019-10-22 08:57:18,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:18,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:18,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-22 08:57:19,088 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:19,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:19,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128263449] [2019-10-22 08:57:19,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:19,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:19,090 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-10-22 08:57:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:19,274 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-10-22 08:57:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:19,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-10-22 08:57:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:19,275 INFO L225 Difference]: With dead ends: 4704 [2019-10-22 08:57:19,275 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:19,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:19,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-10-22 08:57:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:19,280 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:19,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:19,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:19,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:19,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:20,069 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-10-22 08:57:20,282 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-10-22 08:57:20,521 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-22 08:57:20,635 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-10-22 08:57:20,835 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-22 08:57:20,979 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-22 08:57:21,128 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-10-22 08:57:21,268 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-22 08:57:21,412 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-22 08:57:21,583 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-10-22 08:57:21,728 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-22 08:57:21,878 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-22 08:57:22,009 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-22 08:57:22,193 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-22 08:57:22,380 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-10-22 08:57:22,490 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-22 08:57:22,679 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-10-22 08:57:22,816 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-22 08:57:23,030 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-10-22 08:57:23,145 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-22 08:57:23,276 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-22 08:57:23,278 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-10-22 08:57:23,278 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-10-22 08:57:23,278 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-10-22 08:57:23,278 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-10-22 08:57:23,278 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-10-22 08:57:23,279 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-10-22 08:57:23,279 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-10-22 08:57:23,280 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-10-22 08:57:23,280 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-10-22 08:57:23,280 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 08:57:23,280 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,280 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-10-22 08:57:23,280 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-10-22 08:57:23,280 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-22 08:57:23,280 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-10-22 08:57:23,280 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-10-22 08:57:23,283 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L446 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L439 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L446 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-10-22 08:57:23,284 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,285 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-10-22 08:57:23,285 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-10-22 08:57:23,286 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-10-22 08:57:23,286 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-10-22 08:57:23,286 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-10-22 08:57:23,286 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-10-22 08:57:23,286 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-10-22 08:57:23,286 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-10-22 08:57:23,287 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-10-22 08:57:23,287 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-10-22 08:57:23,287 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-10-22 08:57:23,287 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-10-22 08:57:23,287 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,288 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,288 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,288 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:23,288 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-10-22 08:57:23,288 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-10-22 08:57:23,288 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L439 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L446 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-10-22 08:57:23,289 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,290 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,290 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-10-22 08:57:23,290 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 08:57:23,291 INFO L439 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-10-22 08:57:23,291 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L446 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-10-22 08:57:23,292 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-10-22 08:57:23,292 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-10-22 08:57:23,295 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-22 08:57:23,296 INFO L439 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,296 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-10-22 08:57:23,296 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-10-22 08:57:23,296 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-10-22 08:57:23,296 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-10-22 08:57:23,296 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-10-22 08:57:23,296 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-10-22 08:57:23,296 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,297 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:23,297 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 08:57:23,297 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-10-22 08:57:23,297 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-10-22 08:57:23,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:23 BoogieIcfgContainer [2019-10-22 08:57:23,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:23,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:23,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:23,330 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:23,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:07" (3/4) ... [2019-10-22 08:57:23,334 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:23,354 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:57:23,356 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:57:23,475 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b927c48-948a-47b2-b399-264681ef05ac/bin/uautomizer/witness.graphml [2019-10-22 08:57:23,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:23,479 INFO L168 Benchmark]: Toolchain (without parser) took 17597.97 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 847.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 721.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,479 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:23,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.25 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-10-22 08:57:23,480 INFO L168 Benchmark]: Boogie Preprocessor took 39.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,480 INFO L168 Benchmark]: RCFGBuilder took 642.06 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,480 INFO L168 Benchmark]: TraceAbstraction took 16317.50 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 710.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.5 MB). Peak memory consumption was 940.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,481 INFO L168 Benchmark]: Witness Printer took 148.11 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,482 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 403.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 642.06 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16317.50 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 710.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.5 MB). Peak memory consumption was 940.9 MB. Max. memory is 11.5 GB. * Witness Printer took 148.11 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) || ((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8497)) && !(s__state == 8496)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 16.2s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...