./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.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/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/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 d33dcc608b21d2bdbfa0a947775d4e23b857cf07 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:38:05,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:38:05,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:38:05,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:38:05,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:38:05,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:38:05,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:38:05,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:38:05,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:38:05,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:38:05,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:38:05,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:38:05,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:38:05,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:38:05,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:38:05,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:38:05,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:38:05,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:38:05,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:38:05,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:38:05,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:38:05,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:38:05,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:38:05,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:38:05,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:38:05,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:38:05,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:38:05,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:38:05,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:38:05,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:38:05,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:38:05,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:38:05,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:38:05,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:38:05,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:38:05,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:38:05,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:38:05,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:38:05,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:38:05,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:38:05,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:38:05,129 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:38:05,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:38:05,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:38:05,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:38:05,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:38:05,142 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:38:05,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:38:05,143 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:38:05,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:38:05,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:38:05,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:38:05,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:38:05,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:38:05,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:38:05,144 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:38:05,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:38:05,145 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:38:05,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:38:05,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:38:05,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:38:05,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:38:05,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:38:05,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:38:05,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:38:05,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:38:05,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:38:05,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:38:05,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:38:05,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:38:05,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/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 -> d33dcc608b21d2bdbfa0a947775d4e23b857cf07 [2019-11-16 00:38:05,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:38:05,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:38:05,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:38:05,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:38:05,186 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:38:05,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-16 00:38:05,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/data/a2a87135b/18e9df061bfe4436a6134c511fba5046/FLAGec33266ee [2019-11-16 00:38:05,671 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:38:05,672 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-16 00:38:05,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/data/a2a87135b/18e9df061bfe4436a6134c511fba5046/FLAGec33266ee [2019-11-16 00:38:05,703 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/data/a2a87135b/18e9df061bfe4436a6134c511fba5046 [2019-11-16 00:38:05,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:38:05,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:38:05,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:38:05,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:38:05,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:38:05,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:05" (1/1) ... [2019-11-16 00:38:05,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620c936b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:05, skipping insertion in model container [2019-11-16 00:38:05,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:05" (1/1) ... [2019-11-16 00:38:05,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:38:05,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:38:06,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:38:06,040 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:38:06,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:38:06,122 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:38:06,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06 WrapperNode [2019-11-16 00:38:06,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:38:06,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:38:06,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:38:06,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:38:06,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:38:06,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:38:06,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:38:06,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:38:06,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... [2019-11-16 00:38:06,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:38:06,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:38:06,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:38:06,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:38:06,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:38:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:38:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:38:06,523 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:38:07,060 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:38:07,060 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:38:07,061 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:38:07,062 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:38:07,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:07 BoogieIcfgContainer [2019-11-16 00:38:07,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:38:07,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:38:07,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:38:07,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:38:07,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:38:05" (1/3) ... [2019-11-16 00:38:07,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b0e4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:07, skipping insertion in model container [2019-11-16 00:38:07,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:06" (2/3) ... [2019-11-16 00:38:07,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b0e4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:07, skipping insertion in model container [2019-11-16 00:38:07,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:07" (3/3) ... [2019-11-16 00:38:07,070 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-11-16 00:38:07,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:38:07,085 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:38:07,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:38:07,112 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:38:07,112 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:38:07,112 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:38:07,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:38:07,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:38:07,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:38:07,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:38:07,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:38:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-16 00:38:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:38:07,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,136 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] [2019-11-16 00:38:07,137 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-16 00:38:07,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256036861] [2019-11-16 00:38:07,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:07,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256036861] [2019-11-16 00:38:07,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:38:07,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158911774] [2019-11-16 00:38:07,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:07,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:07,322 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-16 00:38:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:07,518 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-16 00:38:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:07,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-16 00:38:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:07,534 INFO L225 Difference]: With dead ends: 251 [2019-11-16 00:38:07,534 INFO L226 Difference]: Without dead ends: 114 [2019-11-16 00:38:07,539 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-11-16 00:38:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-16 00:38:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-16 00:38:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:38:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-16 00:38:07,590 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-16 00:38:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:07,591 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-16 00:38:07,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-16 00:38:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:38:07,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,593 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:07,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-16 00:38:07,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875881393] [2019-11-16 00:38:07,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:07,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875881393] [2019-11-16 00:38:07,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:07,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445428273] [2019-11-16 00:38:07,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:07,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:07,661 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-16 00:38:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:07,815 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-11-16 00:38:07,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:07,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-16 00:38:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:07,818 INFO L225 Difference]: With dead ends: 238 [2019-11-16 00:38:07,818 INFO L226 Difference]: Without dead ends: 133 [2019-11-16 00:38:07,819 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-11-16 00:38:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-16 00:38:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-16 00:38:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-16 00:38:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-16 00:38:07,832 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-16 00:38:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:07,832 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-16 00:38:07,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-16 00:38:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:38:07,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,834 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:07,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-11-16 00:38:07,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903878245] [2019-11-16 00:38:07,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:38:07,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903878245] [2019-11-16 00:38:07,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:07,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339108691] [2019-11-16 00:38:07,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:07,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:07,955 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-16 00:38:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,090 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-16 00:38:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:08,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-16 00:38:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,093 INFO L225 Difference]: With dead ends: 270 [2019-11-16 00:38:08,093 INFO L226 Difference]: Without dead ends: 150 [2019-11-16 00:38:08,094 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-11-16 00:38:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-16 00:38:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-16 00:38:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:38:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-16 00:38:08,105 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-16 00:38:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,105 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-16 00:38:08,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-16 00:38:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:38:08,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,108 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,108 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-11-16 00:38:08,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831088348] [2019-11-16 00:38:08,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:38:08,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831088348] [2019-11-16 00:38:08,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:08,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135410228] [2019-11-16 00:38:08,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:08,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:08,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:08,175 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-16 00:38:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,376 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-16 00:38:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:08,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-16 00:38:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,379 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:38:08,379 INFO L226 Difference]: Without dead ends: 196 [2019-11-16 00:38:08,380 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-11-16 00:38:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-16 00:38:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-16 00:38:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-16 00:38:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-16 00:38:08,393 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-16 00:38:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,394 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-16 00:38:08,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-16 00:38:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:38:08,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,397 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-11-16 00:38:08,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548271873] [2019-11-16 00:38:08,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:38:08,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548271873] [2019-11-16 00:38:08,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:08,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341238891] [2019-11-16 00:38:08,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:08,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:08,454 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-16 00:38:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,587 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-16 00:38:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:08,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-16 00:38:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,590 INFO L225 Difference]: With dead ends: 389 [2019-11-16 00:38:08,590 INFO L226 Difference]: Without dead ends: 211 [2019-11-16 00:38:08,591 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-11-16 00:38:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-16 00:38:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-16 00:38:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-16 00:38:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-16 00:38:08,602 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-16 00:38:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,602 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-16 00:38:08,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-16 00:38:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:38:08,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,607 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,607 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-11-16 00:38:08,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257462722] [2019-11-16 00:38:08,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-16 00:38:08,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257462722] [2019-11-16 00:38:08,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:08,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722126446] [2019-11-16 00:38:08,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:08,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:08,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:08,740 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-16 00:38:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,893 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-16 00:38:08,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:08,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-16 00:38:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,896 INFO L225 Difference]: With dead ends: 427 [2019-11-16 00:38:08,896 INFO L226 Difference]: Without dead ends: 230 [2019-11-16 00:38:08,896 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-11-16 00:38:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-16 00:38:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-16 00:38:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-16 00:38:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-16 00:38:08,906 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-16 00:38:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,906 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-16 00:38:08,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-16 00:38:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:38:08,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,909 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-11-16 00:38:08,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642764785] [2019-11-16 00:38:08,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:38:08,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642764785] [2019-11-16 00:38:08,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:08,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574626897] [2019-11-16 00:38:08,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:08,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:08,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:08,969 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-16 00:38:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,009 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-16 00:38:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:09,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-16 00:38:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,012 INFO L225 Difference]: With dead ends: 661 [2019-11-16 00:38:09,012 INFO L226 Difference]: Without dead ends: 443 [2019-11-16 00:38:09,013 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-11-16 00:38:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-16 00:38:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-16 00:38:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-16 00:38:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-16 00:38:09,025 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-16 00:38:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-16 00:38:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-16 00:38:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-16 00:38:09,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,028 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,028 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-11-16 00:38:09,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052081847] [2019-11-16 00:38:09,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-16 00:38:09,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052081847] [2019-11-16 00:38:09,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:09,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611626057] [2019-11-16 00:38:09,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:09,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:09,108 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-16 00:38:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,159 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-16 00:38:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:09,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-16 00:38:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,164 INFO L225 Difference]: With dead ends: 661 [2019-11-16 00:38:09,164 INFO L226 Difference]: Without dead ends: 659 [2019-11-16 00:38:09,165 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-11-16 00:38:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-16 00:38:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-16 00:38:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-16 00:38:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-16 00:38:09,187 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-16 00:38:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,187 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-16 00:38:09,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-16 00:38:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:38:09,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,190 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-11-16 00:38:09,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-11-16 00:38:09,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91151915] [2019-11-16 00:38:09,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-16 00:38:09,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91151915] [2019-11-16 00:38:09,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:09,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279607341] [2019-11-16 00:38:09,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:09,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:09,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:09,254 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-16 00:38:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,436 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-16 00:38:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:09,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-16 00:38:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,441 INFO L225 Difference]: With dead ends: 1462 [2019-11-16 00:38:09,441 INFO L226 Difference]: Without dead ends: 809 [2019-11-16 00:38:09,443 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-11-16 00:38:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-16 00:38:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-16 00:38:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-16 00:38:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-16 00:38:09,464 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-11-16 00:38:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,464 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-16 00:38:09,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-16 00:38:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:38:09,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,467 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,467 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-11-16 00:38:09,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305088416] [2019-11-16 00:38:09,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-16 00:38:09,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305088416] [2019-11-16 00:38:09,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:09,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372434817] [2019-11-16 00:38:09,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:09,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:09,530 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-16 00:38:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,709 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-16 00:38:09,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:09,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-16 00:38:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,715 INFO L225 Difference]: With dead ends: 1824 [2019-11-16 00:38:09,716 INFO L226 Difference]: Without dead ends: 1006 [2019-11-16 00:38:09,721 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-11-16 00:38:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-16 00:38:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-16 00:38:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-16 00:38:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-16 00:38:09,761 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-16 00:38:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,761 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-16 00:38:09,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-16 00:38:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:38:09,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,766 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,766 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-11-16 00:38:09,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569075703] [2019-11-16 00:38:09,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-16 00:38:09,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569075703] [2019-11-16 00:38:09,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:09,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165832610] [2019-11-16 00:38:09,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:09,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:09,844 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-16 00:38:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,019 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-16 00:38:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:10,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-16 00:38:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,026 INFO L225 Difference]: With dead ends: 2080 [2019-11-16 00:38:10,026 INFO L226 Difference]: Without dead ends: 1079 [2019-11-16 00:38:10,027 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-11-16 00:38:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-16 00:38:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-16 00:38:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-16 00:38:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-16 00:38:10,055 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-16 00:38:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,055 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-16 00:38:10,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-16 00:38:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-16 00:38:10,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,060 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:10,060 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-11-16 00:38:10,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214909298] [2019-11-16 00:38:10,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-16 00:38:10,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214909298] [2019-11-16 00:38:10,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:10,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819280462] [2019-11-16 00:38:10,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:10,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:10,142 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-16 00:38:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,324 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-16 00:38:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:10,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-16 00:38:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,331 INFO L225 Difference]: With dead ends: 2230 [2019-11-16 00:38:10,332 INFO L226 Difference]: Without dead ends: 1160 [2019-11-16 00:38:10,333 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-11-16 00:38:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-16 00:38:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-16 00:38:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-16 00:38:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-16 00:38:10,362 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-16 00:38:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,362 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-16 00:38:10,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-16 00:38:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-16 00:38:10,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,366 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:10,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-11-16 00:38:10,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162121614] [2019-11-16 00:38:10,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-16 00:38:10,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162121614] [2019-11-16 00:38:10,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:10,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877481280] [2019-11-16 00:38:10,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:10,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:10,449 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-16 00:38:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,634 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-16 00:38:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:10,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-16 00:38:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,642 INFO L225 Difference]: With dead ends: 2398 [2019-11-16 00:38:10,642 INFO L226 Difference]: Without dead ends: 1256 [2019-11-16 00:38:10,644 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-11-16 00:38:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-16 00:38:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-16 00:38:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-16 00:38:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-16 00:38:10,675 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-16 00:38:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,676 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-16 00:38:10,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-16 00:38:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-16 00:38:10,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,681 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:10,681 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-11-16 00:38:10,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157250787] [2019-11-16 00:38:10,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-16 00:38:10,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157250787] [2019-11-16 00:38:10,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:10,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310393507] [2019-11-16 00:38:10,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:10,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:10,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:10,774 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-16 00:38:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,820 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-16 00:38:10,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:10,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-16 00:38:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,834 INFO L225 Difference]: With dead ends: 3630 [2019-11-16 00:38:10,834 INFO L226 Difference]: Without dead ends: 2422 [2019-11-16 00:38:10,836 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-11-16 00:38:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-16 00:38:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-16 00:38:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-16 00:38:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-16 00:38:10,901 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-16 00:38:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,901 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-16 00:38:10,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-16 00:38:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-16 00:38:10,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,908 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:10,908 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-11-16 00:38:10,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581402286] [2019-11-16 00:38:10,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-16 00:38:10,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581402286] [2019-11-16 00:38:10,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:10,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293236737] [2019-11-16 00:38:10,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:10,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:10,995 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-16 00:38:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:11,198 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-16 00:38:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:11,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-16 00:38:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:11,213 INFO L225 Difference]: With dead ends: 5143 [2019-11-16 00:38:11,213 INFO L226 Difference]: Without dead ends: 2702 [2019-11-16 00:38:11,216 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-11-16 00:38:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-16 00:38:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-16 00:38:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-16 00:38:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-16 00:38:11,328 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-16 00:38:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:11,329 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-16 00:38:11,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-16 00:38:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-16 00:38:11,336 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:11,337 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:11,337 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-11-16 00:38:11,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:11,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292546240] [2019-11-16 00:38:11,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-16 00:38:11,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292546240] [2019-11-16 00:38:11,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:11,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:11,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934097740] [2019-11-16 00:38:11,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:11,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:11,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:11,439 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-16 00:38:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:11,637 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-16 00:38:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:11,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-16 00:38:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:11,652 INFO L225 Difference]: With dead ends: 5335 [2019-11-16 00:38:11,652 INFO L226 Difference]: Without dead ends: 2696 [2019-11-16 00:38:11,656 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-11-16 00:38:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-16 00:38:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-16 00:38:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-16 00:38:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-16 00:38:11,738 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-16 00:38:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:11,739 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-16 00:38:11,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-16 00:38:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-16 00:38:11,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:11,747 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:11,747 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-11-16 00:38:11,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:11,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010673631] [2019-11-16 00:38:11,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-16 00:38:11,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010673631] [2019-11-16 00:38:11,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:11,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:11,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958913740] [2019-11-16 00:38:11,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:11,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:11,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:11,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:11,874 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-16 00:38:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,073 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-16 00:38:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:12,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-16 00:38:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,089 INFO L225 Difference]: With dead ends: 5299 [2019-11-16 00:38:12,089 INFO L226 Difference]: Without dead ends: 2684 [2019-11-16 00:38:12,093 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-11-16 00:38:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-16 00:38:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-16 00:38:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-16 00:38:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-16 00:38:12,191 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-11-16 00:38:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,192 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-16 00:38:12,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-16 00:38:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-16 00:38:12,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,202 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:12,203 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-11-16 00:38:12,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196441345] [2019-11-16 00:38:12,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-16 00:38:12,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196441345] [2019-11-16 00:38:12,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:12,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953789756] [2019-11-16 00:38:12,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:12,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:12,370 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-16 00:38:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,562 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-16 00:38:12,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:12,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-16 00:38:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,579 INFO L225 Difference]: With dead ends: 5545 [2019-11-16 00:38:12,579 INFO L226 Difference]: Without dead ends: 2930 [2019-11-16 00:38:12,583 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-11-16 00:38:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-16 00:38:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-16 00:38:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-16 00:38:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-16 00:38:12,659 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-16 00:38:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,660 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-16 00:38:12,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-16 00:38:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-16 00:38:12,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,668 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:12,668 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-11-16 00:38:12,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709542404] [2019-11-16 00:38:12,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-16 00:38:12,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709542404] [2019-11-16 00:38:12,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:12,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334494255] [2019-11-16 00:38:12,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:12,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:12,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:12,865 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-16 00:38:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,974 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-16 00:38:12,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:12,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-16 00:38:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:13,020 INFO L225 Difference]: With dead ends: 7734 [2019-11-16 00:38:13,021 INFO L226 Difference]: Without dead ends: 5029 [2019-11-16 00:38:13,024 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-11-16 00:38:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-16 00:38:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-16 00:38:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-16 00:38:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-16 00:38:13,157 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-16 00:38:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:13,157 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-16 00:38:13,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-16 00:38:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-16 00:38:13,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:13,168 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:13,168 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-11-16 00:38:13,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:13,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298301031] [2019-11-16 00:38:13,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-16 00:38:13,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298301031] [2019-11-16 00:38:13,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070166677] [2019-11-16 00:38:13,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:13,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:38:13,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-16 00:38:13,660 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:38:13,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:38:13,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323142192] [2019-11-16 00:38:13,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:13,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:13,663 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-16 00:38:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,175 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-16 00:38:14,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:38:14,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-11-16 00:38:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,192 INFO L225 Difference]: With dead ends: 9987 [2019-11-16 00:38:14,192 INFO L226 Difference]: Without dead ends: 7540 [2019-11-16 00:38:14,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-16 00:38:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-16 00:38:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-16 00:38:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-16 00:38:14,435 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-11-16 00:38:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,436 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-16 00:38:14,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-16 00:38:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-16 00:38:14,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,448 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:14,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:14,653 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-11-16 00:38:14,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069888611] [2019-11-16 00:38:14,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-16 00:38:14,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069888611] [2019-11-16 00:38:14,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322576606] [2019-11-16 00:38:14,878 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:15,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:38:15,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:15,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:38:15,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-16 00:38:15,161 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:38:15,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:38:15,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641655325] [2019-11-16 00:38:15,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:15,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:15,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:15,165 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-16 00:38:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,560 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-16 00:38:15,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:15,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-16 00:38:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,577 INFO L225 Difference]: With dead ends: 12544 [2019-11-16 00:38:15,577 INFO L226 Difference]: Without dead ends: 6979 [2019-11-16 00:38:15,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-16 00:38:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-16 00:38:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-16 00:38:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-16 00:38:15,732 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-16 00:38:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,733 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-16 00:38:15,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-16 00:38:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-16 00:38:15,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,745 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:15,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:15,950 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-11-16 00:38:15,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797330541] [2019-11-16 00:38:15,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-16 00:38:16,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797330541] [2019-11-16 00:38:16,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:16,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240846844] [2019-11-16 00:38:16,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:16,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:16,231 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-16 00:38:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,426 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-16 00:38:16,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:16,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-16 00:38:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,433 INFO L225 Difference]: With dead ends: 11015 [2019-11-16 00:38:16,433 INFO L226 Difference]: Without dead ends: 3069 [2019-11-16 00:38:16,441 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-11-16 00:38:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-16 00:38:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-16 00:38:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-16 00:38:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-16 00:38:16,508 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-16 00:38:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,508 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-16 00:38:16,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-16 00:38:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-16 00:38:16,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,520 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:16,520 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,521 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-11-16 00:38:16,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897695745] [2019-11-16 00:38:16,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-16 00:38:16,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897695745] [2019-11-16 00:38:16,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245728796] [2019-11-16 00:38:16,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:38:16,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-16 00:38:17,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:17,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:38:17,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529553949] [2019-11-16 00:38:17,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:17,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:17,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:17,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:17,432 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-16 00:38:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,472 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-16 00:38:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:17,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-11-16 00:38:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,479 INFO L225 Difference]: With dead ends: 3028 [2019-11-16 00:38:17,479 INFO L226 Difference]: Without dead ends: 2531 [2019-11-16 00:38:17,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-16 00:38:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-16 00:38:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-16 00:38:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-16 00:38:17,542 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 510 [2019-11-16 00:38:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,543 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-16 00:38:17,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-16 00:38:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-16 00:38:17,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,558 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:17,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:17,763 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1673743471, now seen corresponding path program 1 times [2019-11-16 00:38:17,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362106706] [2019-11-16 00:38:17,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-11-16 00:38:17,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362106706] [2019-11-16 00:38:17,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228974903] [2019-11-16 00:38:17,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:38:18,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-16 00:38:18,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:18,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:38:18,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319156576] [2019-11-16 00:38:18,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:18,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:18,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:18,378 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-16 00:38:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,580 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-16 00:38:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:18,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-11-16 00:38:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,587 INFO L225 Difference]: With dead ends: 5060 [2019-11-16 00:38:18,587 INFO L226 Difference]: Without dead ends: 2589 [2019-11-16 00:38:18,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-16 00:38:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-16 00:38:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-16 00:38:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-16 00:38:18,645 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 511 [2019-11-16 00:38:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,646 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-16 00:38:18,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-16 00:38:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-11-16 00:38:18,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,661 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:18,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:18,865 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434925, now seen corresponding path program 2 times [2019-11-16 00:38:18,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:18,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474959519] [2019-11-16 00:38:18,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-16 00:38:19,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474959519] [2019-11-16 00:38:19,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782941734] [2019-11-16 00:38:19,187 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:19,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:38:19,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:19,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:38:19,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-16 00:38:19,709 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:38:19,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:38:19,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615725848] [2019-11-16 00:38:19,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:19,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:19,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:19,712 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-16 00:38:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,887 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-16 00:38:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:19,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 622 [2019-11-16 00:38:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,888 INFO L225 Difference]: With dead ends: 2848 [2019-11-16 00:38:19,888 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:38:19,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:38:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:38:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:38:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:38:19,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 622 [2019-11-16 00:38:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,893 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:38:19,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:38:19,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:38:20,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:20,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:38:20,629 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-16 00:38:21,448 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-16 00:38:21,965 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-16 00:38:22,080 INFO L439 ceAbstractionStarter]: At program point L168(lines 164 498) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,080 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,080 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-16 00:38:22,080 INFO L443 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-16 00:38:22,080 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-16 00:38:22,080 INFO L443 ceAbstractionStarter]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-16 00:38:22,080 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-16 00:38:22,080 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L269-2(lines 201 484) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-16 00:38:22,081 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L439 ceAbstractionStarter]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L439 ceAbstractionStarter]: At program point L174(lines 170 496) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-16 00:38:22,082 INFO L443 ceAbstractionStarter]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L446 ceAbstractionStarter]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L275-2(lines 275 279) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 506) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-16 00:38:22,083 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-16 00:38:22,084 INFO L439 ceAbstractionStarter]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))) [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-16 00:38:22,085 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-16 00:38:22,088 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 504) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,088 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 256) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-16 00:38:22,089 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-16 00:38:22,090 INFO L446 ceAbstractionStarter]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-16 00:38:22,090 INFO L439 ceAbstractionStarter]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) .cse0))) [2019-11-16 00:38:22,090 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,090 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-16 00:38:22,090 INFO L443 ceAbstractionStarter]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-16 00:38:22,090 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 296) no Hoare annotation was computed. [2019-11-16 00:38:22,091 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 255) no Hoare annotation was computed. [2019-11-16 00:38:22,091 INFO L443 ceAbstractionStarter]: For program point L286-2(lines 286 296) no Hoare annotation was computed. [2019-11-16 00:38:22,091 INFO L443 ceAbstractionStarter]: For program point L253-2(lines 201 484) no Hoare annotation was computed. [2019-11-16 00:38:22,091 INFO L439 ceAbstractionStarter]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (not .cse4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse0 .cse7 .cse4) (and .cse8 .cse4 .cse5 .cse9) (and .cse6 .cse10 .cse11 .cse0) (and .cse12 .cse8 .cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse12 .cse0) (and .cse10 .cse11 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse0 .cse4 .cse9) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse4) (and .cse7 .cse5)))) [2019-11-16 00:38:22,092 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-16 00:38:22,092 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-16 00:38:22,092 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-16 00:38:22,092 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-16 00:38:22,092 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-16 00:38:22,092 INFO L439 ceAbstractionStarter]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-16 00:38:22,093 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 288 296) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-16 00:38:22,094 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-16 00:38:22,095 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-16 00:38:22,095 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-16 00:38:22,095 INFO L443 ceAbstractionStarter]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-16 00:38:22,095 INFO L439 ceAbstractionStarter]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (not .cse2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-16 00:38:22,095 INFO L439 ceAbstractionStarter]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-16 00:38:22,096 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-16 00:38:22,097 INFO L443 ceAbstractionStarter]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-16 00:38:22,097 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-16 00:38:22,097 INFO L439 ceAbstractionStarter]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse2) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-16 00:38:22,097 INFO L439 ceAbstractionStarter]: At program point L162(lines 152 502) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-16 00:38:22,097 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-16 00:38:22,097 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 264) no Hoare annotation was computed. [2019-11-16 00:38:22,098 INFO L446 ceAbstractionStarter]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-16 00:38:22,098 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-16 00:38:22,098 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-16 00:38:22,098 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-16 00:38:22,098 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-16 00:38:22,098 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-16 00:38:22,098 INFO L446 ceAbstractionStarter]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-16 00:38:22,099 INFO L439 ceAbstractionStarter]: At program point L132(lines 128 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-16 00:38:22,099 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-16 00:38:22,099 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-16 00:38:22,099 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-16 00:38:22,099 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-16 00:38:22,099 INFO L446 ceAbstractionStarter]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-16 00:38:22,100 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-16 00:38:22,100 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-16 00:38:22,100 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-16 00:38:22,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:38:22 BoogieIcfgContainer [2019-11-16 00:38:22,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:38:22,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:38:22,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:38:22,125 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:38:22,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:07" (3/4) ... [2019-11-16 00:38:22,130 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:38:22,155 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:38:22,156 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:38:22,310 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_180ecc72-748b-45fc-b3d7-c0fad915f2f0/bin/uautomizer/witness.graphml [2019-11-16 00:38:22,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:38:22,311 INFO L168 Benchmark]: Toolchain (without parser) took 16604.40 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 888.1 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -71.8 MB). Peak memory consumption was 816.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:22,312 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:38:22,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:22,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:38:22,313 INFO L168 Benchmark]: Boogie Preprocessor took 49.65 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-11-16 00:38:22,313 INFO L168 Benchmark]: RCFGBuilder took 827.91 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:22,314 INFO L168 Benchmark]: TraceAbstraction took 15060.17 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.4 MB). Peak memory consumption was 796.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:22,314 INFO L168 Benchmark]: Witness Printer took 186.10 ms. Allocated memory is still 1.9 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:22,317 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.59 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 49.65 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 827.91 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15060.17 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.4 MB). Peak memory consumption was 796.8 MB. Max. memory is 11.5 GB. * Witness Printer took 186.10 ms. Allocated memory is still 1.9 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 182]: Loop Invariant Derived loop invariant: (((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 14.9s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 4490 SDtfs, 2115 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 427 HoareAnnotationTreeSize, 22 FomulaSimplifications, 29279 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24849 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 8555 NumberOfCodeBlocks, 8555 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4552471 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 38935/39021 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...