./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.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_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/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 a8546eefa2f2d2c21cb36b9121195492b8a27fd6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:39:32,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:39:32,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:39:32,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:39:32,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:39:32,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:39:32,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:39:32,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:39:32,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:39:32,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:39:32,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:39:32,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:39:32,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:39:32,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:39:32,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:39:32,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:39:32,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:39:32,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:39:32,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:39:32,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:39:32,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:39:32,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:39:32,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:39:32,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:39:32,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:39:32,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:39:32,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:39:32,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:39:32,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:39:32,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:39:32,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:39:32,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:39:32,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:39:32,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:39:32,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:39:32,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:39:32,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:39:32,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:39:32,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:39:32,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:39:32,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:39:32,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:39:32,102 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:39:32,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:39:32,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:39:32,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:39:32,106 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:39:32,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:39:32,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:39:32,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:39:32,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:39:32,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:39:32,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:39:32,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:39:32,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:39:32,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:39:32,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:39:32,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:39:32,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:39:32,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:39:32,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:39:32,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:39:32,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:39:32,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:39:32,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:39:32,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:39:32,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:39:32,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:39:32,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:39:32,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:39:32,111 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_f998449d-fdb7-4ccd-a11a-70477f243c68/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 -> a8546eefa2f2d2c21cb36b9121195492b8a27fd6 [2019-11-15 22:39:32,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:39:32,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:39:32,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:39:32,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:39:32,174 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:39:32,175 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-15 22:39:32,233 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/data/1b45524ec/1970578d199a4e1a919c26a8cf1c514e/FLAG2340259c3 [2019-11-15 22:39:32,678 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:39:32,679 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-15 22:39:32,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/data/1b45524ec/1970578d199a4e1a919c26a8cf1c514e/FLAG2340259c3 [2019-11-15 22:39:33,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/data/1b45524ec/1970578d199a4e1a919c26a8cf1c514e [2019-11-15 22:39:33,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:39:33,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:39:33,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:39:33,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:39:33,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:39:33,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6ea6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33, skipping insertion in model container [2019-11-15 22:39:33,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:39:33,120 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:39:33,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:39:33,407 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:39:33,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:39:33,490 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:39:33,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33 WrapperNode [2019-11-15 22:39:33,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:39:33,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:39:33,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:39:33,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:39:33,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:39:33,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:39:33,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:39:33,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:39:33,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... [2019-11-15 22:39:33,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:39:33,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:39:33,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:39:33,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:39:33,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/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-15 22:39:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:39:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:39:33,756 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:39:34,280 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 22:39:34,281 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 22:39:34,282 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:39:34,282 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:39:34,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:39:34 BoogieIcfgContainer [2019-11-15 22:39:34,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:39:34,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:39:34,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:39:34,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:39:34,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:39:33" (1/3) ... [2019-11-15 22:39:34,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548a1d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:39:34, skipping insertion in model container [2019-11-15 22:39:34,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:39:33" (2/3) ... [2019-11-15 22:39:34,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548a1d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:39:34, skipping insertion in model container [2019-11-15 22:39:34,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:39:34" (3/3) ... [2019-11-15 22:39:34,292 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-11-15 22:39:34,300 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:39:34,308 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:39:34,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:39:34,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:39:34,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:39:34,356 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:39:34,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:39:34,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:39:34,358 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:39:34,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:39:34,358 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:39:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-15 22:39:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:39:34,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:34,390 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-15 22:39:34,392 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-15 22:39:34,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:34,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651960351] [2019-11-15 22:39:34,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:34,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:34,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:34,574 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-15 22:39:34,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651960351] [2019-11-15 22:39:34,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:34,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:39:34,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630020044] [2019-11-15 22:39:34,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:34,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:34,595 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-15 22:39:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:34,813 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-15 22:39:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:34,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 22:39:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:34,826 INFO L225 Difference]: With dead ends: 249 [2019-11-15 22:39:34,826 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 22:39:34,830 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-15 22:39:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 22:39:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 22:39:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 22:39:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-15 22:39:34,871 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-15 22:39:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:34,872 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-15 22:39:34,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-15 22:39:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:39:34,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:34,874 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-15 22:39:34,874 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-15 22:39:34,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:34,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617621460] [2019-11-15 22:39:34,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:34,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:34,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:34,978 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-15 22:39:34,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617621460] [2019-11-15 22:39:34,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:34,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:34,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981827111] [2019-11-15 22:39:34,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:34,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:34,982 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-15 22:39:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:35,136 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-15 22:39:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:35,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 22:39:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:35,139 INFO L225 Difference]: With dead ends: 235 [2019-11-15 22:39:35,139 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 22:39:35,140 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-15 22:39:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 22:39:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-15 22:39:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 22:39:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-15 22:39:35,151 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-15 22:39:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:35,151 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-15 22:39:35,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-15 22:39:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:39:35,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:35,153 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-15 22:39:35,154 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-15 22:39:35,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:35,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255285384] [2019-11-15 22:39:35,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:35,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:35,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:35,267 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-15 22:39:35,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255285384] [2019-11-15 22:39:35,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:35,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:35,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214108761] [2019-11-15 22:39:35,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:35,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:35,270 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-15 22:39:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:35,422 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-15 22:39:35,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:35,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 22:39:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:35,424 INFO L225 Difference]: With dead ends: 268 [2019-11-15 22:39:35,424 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:39:35,425 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-15 22:39:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:39:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-15 22:39:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-15 22:39:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-15 22:39:35,444 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-15 22:39:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:35,445 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-15 22:39:35,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-15 22:39:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:39:35,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:35,448 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-15 22:39:35,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-15 22:39:35,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:35,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896918998] [2019-11-15 22:39:35,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:35,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:35,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:35,546 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-15 22:39:35,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896918998] [2019-11-15 22:39:35,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:35,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:35,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602528733] [2019-11-15 22:39:35,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:35,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:35,548 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-15 22:39:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:35,775 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-15 22:39:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:35,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 22:39:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:35,778 INFO L225 Difference]: With dead ends: 332 [2019-11-15 22:39:35,778 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 22:39:35,778 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-15 22:39:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 22:39:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-15 22:39:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 22:39:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-15 22:39:35,796 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-15 22:39:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:35,796 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-15 22:39:35,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-15 22:39:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:39:35,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:35,799 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-15 22:39:35,800 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-15 22:39:35,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:35,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650261829] [2019-11-15 22:39:35,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:35,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:35,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:35,864 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-15 22:39:35,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650261829] [2019-11-15 22:39:35,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:35,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:35,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5450606] [2019-11-15 22:39:35,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:35,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:35,866 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-15 22:39:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:36,023 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-15 22:39:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:36,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 22:39:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:36,025 INFO L225 Difference]: With dead ends: 386 [2019-11-15 22:39:36,026 INFO L226 Difference]: Without dead ends: 209 [2019-11-15 22:39:36,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-15 22:39:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-15 22:39:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-15 22:39:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 22:39:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-15 22:39:36,038 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-15 22:39:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:36,038 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-15 22:39:36,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-15 22:39:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:39:36,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:36,042 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] [2019-11-15 22:39:36,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-15 22:39:36,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:36,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178678698] [2019-11-15 22:39:36,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:36,118 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-15 22:39:36,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178678698] [2019-11-15 22:39:36,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:36,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:36,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274148715] [2019-11-15 22:39:36,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:36,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:36,124 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-15 22:39:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:36,263 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-15 22:39:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:36,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:39:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:36,266 INFO L225 Difference]: With dead ends: 425 [2019-11-15 22:39:36,266 INFO L226 Difference]: Without dead ends: 229 [2019-11-15 22:39:36,266 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-15 22:39:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-15 22:39:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-15 22:39:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-15 22:39:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-15 22:39:36,274 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-15 22:39:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:36,275 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-15 22:39:36,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-15 22:39:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 22:39:36,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:36,278 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] [2019-11-15 22:39:36,278 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-15 22:39:36,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:36,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309063380] [2019-11-15 22:39:36,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:36,330 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-15 22:39:36,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309063380] [2019-11-15 22:39:36,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:36,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:36,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566096523] [2019-11-15 22:39:36,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:36,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:36,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:36,333 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-15 22:39:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:36,371 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-15 22:39:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:36,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 22:39:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:36,375 INFO L225 Difference]: With dead ends: 658 [2019-11-15 22:39:36,376 INFO L226 Difference]: Without dead ends: 441 [2019-11-15 22:39:36,378 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-15 22:39:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-15 22:39:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-15 22:39:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-15 22:39:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-15 22:39:36,398 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-15 22:39:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:36,398 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-15 22:39:36,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-15 22:39:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:39:36,401 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:36,402 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] [2019-11-15 22:39:36,402 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-15 22:39:36,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:36,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519420036] [2019-11-15 22:39:36,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:36,479 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-15 22:39:36,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519420036] [2019-11-15 22:39:36,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:36,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:36,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932556130] [2019-11-15 22:39:36,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:36,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:36,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:36,482 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-11-15 22:39:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:36,521 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-11-15 22:39:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:36,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 22:39:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:36,526 INFO L225 Difference]: With dead ends: 658 [2019-11-15 22:39:36,526 INFO L226 Difference]: Without dead ends: 656 [2019-11-15 22:39:36,527 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-15 22:39:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-15 22:39:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-15 22:39:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-15 22:39:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-15 22:39:36,551 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-11-15 22:39:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:36,551 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-15 22:39:36,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-15 22:39:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 22:39:36,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:36,554 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-15 22:39:36,554 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-11-15 22:39:36,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:36,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971171748] [2019-11-15 22:39:36,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:39:36,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971171748] [2019-11-15 22:39:36,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:36,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:36,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981702784] [2019-11-15 22:39:36,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:36,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:36,627 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-15 22:39:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:36,777 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-11-15 22:39:36,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:36,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-15 22:39:36,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:36,782 INFO L225 Difference]: With dead ends: 1383 [2019-11-15 22:39:36,782 INFO L226 Difference]: Without dead ends: 736 [2019-11-15 22:39:36,783 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-15 22:39:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-15 22:39:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-11-15 22:39:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-11-15 22:39:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-11-15 22:39:36,801 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-11-15 22:39:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:36,802 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-11-15 22:39:36,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-11-15 22:39:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:39:36,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:36,805 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-15 22:39:36,805 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-11-15 22:39:36,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:36,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441592508] [2019-11-15 22:39:36,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:36,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 22:39:36,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441592508] [2019-11-15 22:39:36,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:36,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:36,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577036078] [2019-11-15 22:39:36,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:36,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:36,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:36,856 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-11-15 22:39:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:37,031 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-11-15 22:39:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:37,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-15 22:39:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:37,037 INFO L225 Difference]: With dead ends: 1594 [2019-11-15 22:39:37,037 INFO L226 Difference]: Without dead ends: 875 [2019-11-15 22:39:37,038 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-15 22:39:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-11-15 22:39:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-11-15 22:39:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-15 22:39:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-11-15 22:39:37,059 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-11-15 22:39:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:37,060 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-11-15 22:39:37,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-11-15 22:39:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 22:39:37,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:37,063 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2019-11-15 22:39:37,063 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:37,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-11-15 22:39:37,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:37,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642877634] [2019-11-15 22:39:37,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 22:39:37,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642877634] [2019-11-15 22:39:37,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:37,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:37,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290444041] [2019-11-15 22:39:37,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:37,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:37,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:37,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:37,152 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-11-15 22:39:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:37,290 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-11-15 22:39:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:37,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-15 22:39:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:37,297 INFO L225 Difference]: With dead ends: 1765 [2019-11-15 22:39:37,297 INFO L226 Difference]: Without dead ends: 932 [2019-11-15 22:39:37,298 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-15 22:39:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-11-15 22:39:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-11-15 22:39:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-15 22:39:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-11-15 22:39:37,322 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-11-15 22:39:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:37,323 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-11-15 22:39:37,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-11-15 22:39:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 22:39:37,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:37,327 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2019-11-15 22:39:37,327 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-11-15 22:39:37,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:37,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79871119] [2019-11-15 22:39:37,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 22:39:37,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79871119] [2019-11-15 22:39:37,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:37,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:37,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036687833] [2019-11-15 22:39:37,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:37,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:37,408 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-11-15 22:39:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:37,560 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-11-15 22:39:37,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:37,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-15 22:39:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:37,567 INFO L225 Difference]: With dead ends: 1945 [2019-11-15 22:39:37,567 INFO L226 Difference]: Without dead ends: 1028 [2019-11-15 22:39:37,568 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-15 22:39:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-15 22:39:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-11-15 22:39:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-15 22:39:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-11-15 22:39:37,597 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-11-15 22:39:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:37,598 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-11-15 22:39:37,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-11-15 22:39:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 22:39:37,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:37,602 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1] [2019-11-15 22:39:37,602 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-11-15 22:39:37,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:37,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121461919] [2019-11-15 22:39:37,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-15 22:39:37,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121461919] [2019-11-15 22:39:37,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:37,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:37,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462282945] [2019-11-15 22:39:37,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:37,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:37,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:37,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:37,677 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-11-15 22:39:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:37,715 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-11-15 22:39:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:37,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-15 22:39:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:37,726 INFO L225 Difference]: With dead ends: 3036 [2019-11-15 22:39:37,726 INFO L226 Difference]: Without dead ends: 2026 [2019-11-15 22:39:37,728 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-15 22:39:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-11-15 22:39:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-11-15 22:39:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-15 22:39:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-11-15 22:39:37,778 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-11-15 22:39:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:37,779 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-11-15 22:39:37,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-11-15 22:39:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 22:39:37,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:37,785 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1] [2019-11-15 22:39:37,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-11-15 22:39:37,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:37,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126701692] [2019-11-15 22:39:37,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:37,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 22:39:37,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126701692] [2019-11-15 22:39:37,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:37,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:37,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162155474] [2019-11-15 22:39:37,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:37,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:37,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:37,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:37,866 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-11-15 22:39:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:38,060 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-11-15 22:39:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:38,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-15 22:39:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:38,073 INFO L225 Difference]: With dead ends: 4264 [2019-11-15 22:39:38,073 INFO L226 Difference]: Without dead ends: 2249 [2019-11-15 22:39:38,076 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-15 22:39:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-15 22:39:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-11-15 22:39:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-11-15 22:39:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-11-15 22:39:38,131 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-11-15 22:39:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:38,132 INFO L462 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-11-15 22:39:38,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-11-15 22:39:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-15 22:39:38,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:38,139 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:38,139 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-11-15 22:39:38,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:38,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3910238] [2019-11-15 22:39:38,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:38,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:38,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-15 22:39:38,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3910238] [2019-11-15 22:39:38,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:38,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:38,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920037291] [2019-11-15 22:39:38,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:38,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:38,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:38,220 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-11-15 22:39:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:38,396 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-11-15 22:39:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:38,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-15 22:39:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:38,409 INFO L225 Difference]: With dead ends: 4576 [2019-11-15 22:39:38,410 INFO L226 Difference]: Without dead ends: 2348 [2019-11-15 22:39:38,414 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-15 22:39:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-11-15 22:39:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-11-15 22:39:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-11-15 22:39:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-11-15 22:39:38,479 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-11-15 22:39:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:38,479 INFO L462 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-11-15 22:39:38,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-11-15 22:39:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:39:38,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:38,487 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:38,487 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:38,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-11-15 22:39:38,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:38,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878986349] [2019-11-15 22:39:38,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:38,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:38,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-15 22:39:38,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878986349] [2019-11-15 22:39:38,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:38,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:38,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354003553] [2019-11-15 22:39:38,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:38,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:38,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:38,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:38,600 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-11-15 22:39:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:38,796 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-11-15 22:39:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:38,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-15 22:39:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:38,811 INFO L225 Difference]: With dead ends: 4963 [2019-11-15 22:39:38,811 INFO L226 Difference]: Without dead ends: 2636 [2019-11-15 22:39:38,814 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-15 22:39:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-15 22:39:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-11-15 22:39:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-11-15 22:39:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-11-15 22:39:38,926 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-11-15 22:39:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:38,927 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-11-15 22:39:38,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-11-15 22:39:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 22:39:38,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:38,935 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:38,936 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:38,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-11-15 22:39:38,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:38,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313883754] [2019-11-15 22:39:38,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:38,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:38,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-15 22:39:39,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313883754] [2019-11-15 22:39:39,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454275345] [2019-11-15 22:39:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/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-15 22:39:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:39,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:39:39,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-15 22:39:39,301 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:39:39,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:39:39,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315615908] [2019-11-15 22:39:39,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:39:39,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:39:39,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:39:39,304 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-11-15 22:39:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:39,728 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-11-15 22:39:39,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:39:39,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-15 22:39:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:39,758 INFO L225 Difference]: With dead ends: 8082 [2019-11-15 22:39:39,758 INFO L226 Difference]: Without dead ends: 5509 [2019-11-15 22:39:39,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 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-15 22:39:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-11-15 22:39:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-11-15 22:39:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-11-15 22:39:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-11-15 22:39:39,908 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-11-15 22:39:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:39,909 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-11-15 22:39:39,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:39:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-11-15 22:39:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 22:39:39,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:39,922 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:40,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:39:40,136 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-11-15 22:39:40,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:40,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987436100] [2019-11-15 22:39:40,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:40,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:40,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-15 22:39:40,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987436100] [2019-11-15 22:39:40,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:40,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:40,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304728057] [2019-11-15 22:39:40,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:40,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:40,347 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-11-15 22:39:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:40,455 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-11-15 22:39:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:40,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-15 22:39:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:40,509 INFO L225 Difference]: With dead ends: 12402 [2019-11-15 22:39:40,509 INFO L226 Difference]: Without dead ends: 7294 [2019-11-15 22:39:40,516 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-15 22:39:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-11-15 22:39:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-11-15 22:39:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-11-15 22:39:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-11-15 22:39:40,692 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-11-15 22:39:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:40,693 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-11-15 22:39:40,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-11-15 22:39:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-15 22:39:40,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:40,707 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:40,708 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-11-15 22:39:40,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:40,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108522288] [2019-11-15 22:39:40,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:40,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:40,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-11-15 22:39:40,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108522288] [2019-11-15 22:39:40,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:40,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:40,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028981394] [2019-11-15 22:39:40,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:40,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:40,840 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-11-15 22:39:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:41,063 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-11-15 22:39:41,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:41,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-11-15 22:39:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:41,079 INFO L225 Difference]: With dead ends: 14569 [2019-11-15 22:39:41,079 INFO L226 Difference]: Without dead ends: 7286 [2019-11-15 22:39:41,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-11-15 22:39:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-11-15 22:39:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-11-15 22:39:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-11-15 22:39:41,302 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-11-15 22:39:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:41,302 INFO L462 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-11-15 22:39:41,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-11-15 22:39:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-15 22:39:41,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:41,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:41,315 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-11-15 22:39:41,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:41,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606351449] [2019-11-15 22:39:41,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:41,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:41,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 22:39:41,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606351449] [2019-11-15 22:39:41,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:41,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:41,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412269583] [2019-11-15 22:39:41,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:41,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:41,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:41,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:41,434 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-11-15 22:39:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:41,694 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-11-15 22:39:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:41,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-11-15 22:39:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:41,710 INFO L225 Difference]: With dead ends: 13675 [2019-11-15 22:39:41,711 INFO L226 Difference]: Without dead ends: 7415 [2019-11-15 22:39:41,719 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-15 22:39:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-11-15 22:39:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-11-15 22:39:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-11-15 22:39:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-11-15 22:39:41,886 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-11-15 22:39:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:41,886 INFO L462 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-11-15 22:39:41,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-11-15 22:39:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-15 22:39:41,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:41,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:41,900 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-11-15 22:39:41,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:41,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003967406] [2019-11-15 22:39:41,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:41,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:41,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 22:39:42,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003967406] [2019-11-15 22:39:42,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408826295] [2019-11-15 22:39:42,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/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-15 22:39:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:42,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:39:42,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-15 22:39:42,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:39:42,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:39:42,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399050727] [2019-11-15 22:39:42,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:42,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:39:42,498 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 3 states. [2019-11-15 22:39:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:42,606 INFO L93 Difference]: Finished difference Result 15401 states and 19915 transitions. [2019-11-15 22:39:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:42,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-15 22:39:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:42,625 INFO L225 Difference]: With dead ends: 15401 [2019-11-15 22:39:42,625 INFO L226 Difference]: Without dead ends: 8799 [2019-11-15 22:39:42,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 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-15 22:39:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-11-15 22:39:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 8799. [2019-11-15 22:39:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2019-11-15 22:39:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 11356 transitions. [2019-11-15 22:39:42,829 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 11356 transitions. Word has length 371 [2019-11-15 22:39:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:42,830 INFO L462 AbstractCegarLoop]: Abstraction has 8799 states and 11356 transitions. [2019-11-15 22:39:42,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 11356 transitions. [2019-11-15 22:39:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-15 22:39:42,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:42,848 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, 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-15 22:39:43,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:39:43,052 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:43,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:43,053 INFO L82 PathProgramCache]: Analyzing trace with hash -106230564, now seen corresponding path program 1 times [2019-11-15 22:39:43,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:43,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228716299] [2019-11-15 22:39:43,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:43,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:43,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 22:39:43,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228716299] [2019-11-15 22:39:43,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141489191] [2019-11-15 22:39:43,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/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-15 22:39:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:43,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:39:43,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 22:39:43,508 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:39:43,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:39:43,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561065673] [2019-11-15 22:39:43,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:39:43,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:39:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:39:43,511 INFO L87 Difference]: Start difference. First operand 8799 states and 11356 transitions. Second operand 4 states. [2019-11-15 22:39:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:43,929 INFO L93 Difference]: Finished difference Result 19741 states and 25400 transitions. [2019-11-15 22:39:43,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:39:43,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-15 22:39:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:43,949 INFO L225 Difference]: With dead ends: 19741 [2019-11-15 22:39:43,949 INFO L226 Difference]: Without dead ends: 10934 [2019-11-15 22:39:43,961 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-15 22:39:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-11-15 22:39:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-11-15 22:39:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-11-15 22:39:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-11-15 22:39:44,171 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 373 [2019-11-15 22:39:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:44,171 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-11-15 22:39:44,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:39:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-11-15 22:39:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-15 22:39:44,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:44,194 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, 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] [2019-11-15 22:39:44,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:39:44,399 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-11-15 22:39:44,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:44,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825476623] [2019-11-15 22:39:44,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:44,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:44,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-15 22:39:44,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825476623] [2019-11-15 22:39:44,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:39:44,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:39:44,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740304820] [2019-11-15 22:39:44,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:39:44,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:39:44,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:39:44,562 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-11-15 22:39:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:44,791 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-11-15 22:39:44,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:39:44,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-15 22:39:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:44,798 INFO L225 Difference]: With dead ends: 18222 [2019-11-15 22:39:44,799 INFO L226 Difference]: Without dead ends: 3798 [2019-11-15 22:39:44,815 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-15 22:39:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-11-15 22:39:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-11-15 22:39:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-11-15 22:39:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-11-15 22:39:44,887 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-11-15 22:39:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:44,888 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-11-15 22:39:44,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:39:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-11-15 22:39:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-15 22:39:44,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:44,899 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:39:44,900 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-11-15 22:39:44,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:39:44,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762273281] [2019-11-15 22:39:44,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:44,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:39:44,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:39:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-15 22:39:45,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762273281] [2019-11-15 22:39:45,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63662243] [2019-11-15 22:39:45,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/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-15 22:39:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:45,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:39:45,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-15 22:39:45,478 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:39:45,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:39:45,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407853937] [2019-11-15 22:39:45,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:39:45,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:39:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:39:45,481 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-11-15 22:39:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:45,685 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-11-15 22:39:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:39:45,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-15 22:39:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:45,686 INFO L225 Difference]: With dead ends: 3784 [2019-11-15 22:39:45,686 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:39:45,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 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-15 22:39:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:39:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:39:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:39:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:39:45,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-11-15 22:39:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:45,690 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:39:45,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:39:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:39:45,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:39:45,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:39:45,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:39:46,357 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 96 [2019-11-15 22:39:47,351 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-11-15 22:39:47,765 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-11-15 22:39:48,054 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 490) no Hoare annotation was computed. [2019-11-15 22:39:48,055 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 501) no Hoare annotation was computed. [2019-11-15 22:39:48,055 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 512) no Hoare annotation was computed. [2019-11-15 22:39:48,055 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-15 22:39:48,055 INFO L443 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-15 22:39:48,055 INFO L439 ceAbstractionStarter]: At program point L136(lines 132 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-15 22:39:48,055 INFO L446 ceAbstractionStarter]: At program point L533(lines 95 534) the Hoare annotation is: true [2019-11-15 22:39:48,055 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-15 22:39:48,055 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 239) no Hoare annotation was computed. [2019-11-15 22:39:48,056 INFO L443 ceAbstractionStarter]: For program point L269-2(lines 269 273) no Hoare annotation was computed. [2019-11-15 22:39:48,056 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 306) no Hoare annotation was computed. [2019-11-15 22:39:48,056 INFO L439 ceAbstractionStarter]: At program point L204(lines 102 512) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1) (and .cse0 .cse1))) [2019-11-15 22:39:48,056 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 489) no Hoare annotation was computed. [2019-11-15 22:39:48,056 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 500) no Hoare annotation was computed. [2019-11-15 22:39:48,056 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 511) no Hoare annotation was computed. [2019-11-15 22:39:48,056 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 490) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-15 22:39:48,056 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 473) no Hoare annotation was computed. [2019-11-15 22:39:48,057 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 449) no Hoare annotation was computed. [2019-11-15 22:39:48,057 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 419) no Hoare annotation was computed. [2019-11-15 22:39:48,057 INFO L443 ceAbstractionStarter]: For program point L405-1(lines 405 419) no Hoare annotation was computed. [2019-11-15 22:39:48,057 INFO L443 ceAbstractionStarter]: For program point L438-2(lines 438 449) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 488) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 499) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 510) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L538-2(lines 538 540) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L439 ceAbstractionStarter]: At program point L142(lines 138 500) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 343) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L209(lines 209 211) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L209-2(lines 209 211) no Hoare annotation was computed. [2019-11-15 22:39:48,058 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 377) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 487) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 498) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 509) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 415) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 488) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L443 ceAbstractionStarter]: For program point L278-1(lines 278 288) no Hoare annotation was computed. [2019-11-15 22:39:48,059 INFO L446 ceAbstractionStarter]: At program point L543(lines 10 545) the Hoare annotation is: true [2019-11-15 22:39:48,059 INFO L439 ceAbstractionStarter]: At program point L312(lines 74 544) the Hoare annotation is: false [2019-11-15 22:39:48,060 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 486) no Hoare annotation was computed. [2019-11-15 22:39:48,060 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 497) no Hoare annotation was computed. [2019-11-15 22:39:48,060 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 508) no Hoare annotation was computed. [2019-11-15 22:39:48,060 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-11-15 22:39:48,060 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 217) no Hoare annotation was computed. [2019-11-15 22:39:48,060 INFO L439 ceAbstractionStarter]: At program point L148(lines 144 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2))) [2019-11-15 22:39:48,060 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L439 ceAbstractionStarter]: At program point L479(lines 96 532) the Hoare annotation is: (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse5 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse7 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse1 .cse4) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse8) (and .cse10 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse7) (and .cse9 .cse5 .cse8) (and .cse0 .cse5 .cse7) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse5 .cse7) (and .cse1 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse1) (and .cse5 .cse4 .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4496) .cse5 .cse7) (and .cse5 .cse7 (= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4480) .cse5 .cse7))) [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 250) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L248-2(lines 199 478) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 385) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 199 478) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 280 288) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 485) no Hoare annotation was computed. [2019-11-15 22:39:48,061 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 496) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 507) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 530) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 486) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-15 22:39:48,062 INFO L439 ceAbstractionStarter]: At program point L118(lines 114 508) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 529) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 352) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:39:48,062 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 521) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L516-2(lines 515 529) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 484) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 495) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 506) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 231) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 199 478) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 520) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 359) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L354-2(lines 354 359) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 225) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 483) no Hoare annotation was computed. [2019-11-15 22:39:48,063 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 494) no Hoare annotation was computed. [2019-11-15 22:39:48,064 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 505) no Hoare annotation was computed. [2019-11-15 22:39:48,064 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-11-15 22:39:48,064 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 456) no Hoare annotation was computed. [2019-11-15 22:39:48,064 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:39:48,064 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-15 22:39:48,066 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 484) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 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)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (and .cse0 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2019-11-15 22:39:48,067 INFO L439 ceAbstractionStarter]: At program point L124(lines 120 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-15 22:39:48,067 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-11-15 22:39:48,068 INFO L446 ceAbstractionStarter]: At program point L554(lines 546 556) the Hoare annotation is: true [2019-11-15 22:39:48,068 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-15 22:39:48,068 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 199 478) no Hoare annotation was computed. [2019-11-15 22:39:48,068 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 393) no Hoare annotation was computed. [2019-11-15 22:39:48,068 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 482) no Hoare annotation was computed. [2019-11-15 22:39:48,069 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 493) no Hoare annotation was computed. [2019-11-15 22:39:48,069 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 504) no Hoare annotation was computed. [2019-11-15 22:39:48,069 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 527) no Hoare annotation was computed. [2019-11-15 22:39:48,069 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-11-15 22:39:48,069 INFO L439 ceAbstractionStarter]: At program point L193(lines 192 482) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse4 .cse1 .cse3))) [2019-11-15 22:39:48,070 INFO L439 ceAbstractionStarter]: At program point L160(lines 150 496) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 427) no Hoare annotation was computed. [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 481) no Hoare annotation was computed. [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 492) no Hoare annotation was computed. [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 503) no Hoare annotation was computed. [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 74 544) no Hoare annotation was computed. [2019-11-15 22:39:48,070 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-15 22:39:48,071 INFO L443 ceAbstractionStarter]: For program point L460-2(lines 460 462) no Hoare annotation was computed. [2019-11-15 22:39:48,071 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 297) no Hoare annotation was computed. [2019-11-15 22:39:48,071 INFO L443 ceAbstractionStarter]: For program point L295-2(lines 199 478) no Hoare annotation was computed. [2019-11-15 22:39:48,071 INFO L446 ceAbstractionStarter]: At program point L196(lines 195 481) the Hoare annotation is: true [2019-11-15 22:39:48,071 INFO L439 ceAbstractionStarter]: At program point L130(lines 126 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-15 22:39:48,071 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L428-2(lines 428 432) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L329-2(lines 329 333) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L263-2(lines 199 478) no Hoare annotation was computed. [2019-11-15 22:39:48,072 INFO L446 ceAbstractionStarter]: At program point L198(lines 197 481) the Hoare annotation is: true [2019-11-15 22:39:48,072 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 491) no Hoare annotation was computed. [2019-11-15 22:39:48,073 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 502) no Hoare annotation was computed. [2019-11-15 22:39:48,073 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 513) no Hoare annotation was computed. [2019-11-15 22:39:48,073 INFO L439 ceAbstractionStarter]: At program point L166(lines 162 492) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-15 22:39:48,073 INFO L439 ceAbstractionStarter]: At program point L100(lines 99 513) the Hoare annotation is: (let ((.cse0 (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-15 22:39:48,073 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-15 22:39:48,073 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 367) no Hoare annotation was computed. [2019-11-15 22:39:48,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:39:48 BoogieIcfgContainer [2019-11-15 22:39:48,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:39:48,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:39:48,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:39:48,119 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:39:48,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:39:34" (3/4) ... [2019-11-15 22:39:48,124 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:39:48,149 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:39:48,150 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:39:48,300 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f998449d-fdb7-4ccd-a11a-70477f243c68/bin/uautomizer/witness.graphml [2019-11-15 22:39:48,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:39:48,302 INFO L168 Benchmark]: Toolchain (without parser) took 15239.94 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 701.5 MB). Free memory was 951.4 MB in the beginning and 865.8 MB in the end (delta: 85.7 MB). Peak memory consumption was 787.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:48,302 INFO L168 Benchmark]: CDTParser took 0.26 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-15 22:39:48,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:48,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.43 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-15 22:39:48,303 INFO L168 Benchmark]: Boogie Preprocessor took 36.66 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-15 22:39:48,303 INFO L168 Benchmark]: RCFGBuilder took 701.46 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-15 22:39:48,304 INFO L168 Benchmark]: TraceAbstraction took 13834.22 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 555.7 MB). Free memory was 1.1 GB in the beginning and 887.5 MB in the end (delta: 191.9 MB). Peak memory consumption was 747.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:48,304 INFO L168 Benchmark]: Witness Printer took 181.34 ms. Allocated memory is still 1.7 GB. Free memory was 887.5 MB in the beginning and 865.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:48,306 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.26 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 428.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.43 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 36.66 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 701.46 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 13834.22 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 555.7 MB). Free memory was 1.1 GB in the beginning and 887.5 MB in the end (delta: 191.9 MB). Peak memory consumption was 747.7 MB. Max. memory is 11.5 GB. * Witness Printer took 181.34 ms. Allocated memory is still 1.7 GB. Free memory was 887.5 MB in the beginning and 865.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: 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: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((4560 <= s__state && blastFlag <= 2) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((4512 == s__state && blastFlag <= 2) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (blastFlag <= 2 && s__state == 4528)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 0 == s__hit)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((4512 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (blastFlag <= 2 && 4368 == s__state)) || (s__state == 4384 && blastFlag <= 2)) || ((s__s3__tmp__new_cipher__algorithms == 256 && s__state == 4528) && 0 == s__hit)) || ((s__state == 4496 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 0 == s__hit) && 4464 == s__state)) || ((s__state == 4480 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (blastFlag <= 2 && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 12292 == s__state) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 12292 == s__state) && 0 == s__hit) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 13.7s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 4616 SDtfs, 1482 SDslu, 2556 SDs, 0 SdLazy, 2390 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 12234 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1989 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 6398 NumberOfCodeBlocks, 6398 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2622380 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 21955/22034 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...