./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/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 1e9943d2199c95030d170f0541cc4df722deb62f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/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 1e9943d2199c95030d170f0541cc4df722deb62f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:20,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:20,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:20,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:20,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:20,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:20,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:20,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:20,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:20,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:20,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:20,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:20,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:20,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:20,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:20,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:20,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:20,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:20,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:20,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:20,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:20,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:20,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:20,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:20,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:20,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:20,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:20,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:20,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:20,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:20,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:20,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:20,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:20,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:20,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:20,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:20,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:20,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:20,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:20,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:20,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:20,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:20,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:20,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:20,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:20,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:20,718 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:20,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:20,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:20,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:20,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:20,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:20,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:20,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:20,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:20,720 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:20,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:20,720 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:20,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:20,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:20,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:20,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:20,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:20,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:20,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:20,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:20,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:20,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:20,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:20,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:20,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-10-22 09:01:20,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:20,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:20,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:20,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:20,774 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:20,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-10-22 09:01:20,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/d7ff707af/db4babbcdc0d415495929885ffa5ed1c/FLAG0ba4ea64e [2019-10-22 09:01:21,272 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:21,273 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-10-22 09:01:21,286 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/d7ff707af/db4babbcdc0d415495929885ffa5ed1c/FLAG0ba4ea64e [2019-10-22 09:01:21,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/d7ff707af/db4babbcdc0d415495929885ffa5ed1c [2019-10-22 09:01:21,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:21,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:21,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:21,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:21,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:21,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37315c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21, skipping insertion in model container [2019-10-22 09:01:21,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,826 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:21,867 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:22,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:22,187 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:22,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:22,288 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:22,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22 WrapperNode [2019-10-22 09:01:22,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:22,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:22,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:22,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:22,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:22,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:22,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:22,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:22,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:22,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:22,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:22,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:22,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:22,642 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:01:23,203 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 09:01:23,203 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 09:01:23,205 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:23,205 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:23,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:23 BoogieIcfgContainer [2019-10-22 09:01:23,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:23,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:23,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:23,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:23,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:21" (1/3) ... [2019-10-22 09:01:23,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b488984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:23, skipping insertion in model container [2019-10-22 09:01:23,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (2/3) ... [2019-10-22 09:01:23,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b488984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:23, skipping insertion in model container [2019-10-22 09:01:23,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:23" (3/3) ... [2019-10-22 09:01:23,215 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-10-22 09:01:23,226 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:23,234 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:23,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:23,273 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:23,273 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:23,273 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:23,274 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:23,274 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:23,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:23,274 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:23,274 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-22 09:01:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:01:23,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,301 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-10-22 09:01:23,303 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-10-22 09:01:23,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376336202] [2019-10-22 09:01:23,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:23,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376336202] [2019-10-22 09:01:23,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:23,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958067621] [2019-10-22 09:01:23,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,525 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-10-22 09:01:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:23,716 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-10-22 09:01:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:23,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:01:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:23,731 INFO L225 Difference]: With dead ends: 245 [2019-10-22 09:01:23,731 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 09:01:23,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 09:01:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 09:01:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 09:01:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-10-22 09:01:23,782 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-10-22 09:01:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:23,782 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-10-22 09:01:23,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-10-22 09:01:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 09:01:23,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,784 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] [2019-10-22 09:01:23,784 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,785 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-10-22 09:01:23,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683054224] [2019-10-22 09:01:23,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:23,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683054224] [2019-10-22 09:01:23,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:23,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561058943] [2019-10-22 09:01:23,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,859 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-10-22 09:01:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,024 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-10-22 09:01:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 09:01:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,027 INFO L225 Difference]: With dead ends: 232 [2019-10-22 09:01:24,027 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 09:01:24,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 09:01:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-22 09:01:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 09:01:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-10-22 09:01:24,040 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-10-22 09:01:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,040 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-10-22 09:01:24,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-10-22 09:01:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 09:01:24,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,042 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] [2019-10-22 09:01:24,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-10-22 09:01:24,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220686855] [2019-10-22 09:01:24,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:24,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220686855] [2019-10-22 09:01:24,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:24,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200605553] [2019-10-22 09:01:24,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,155 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-10-22 09:01:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,296 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-10-22 09:01:24,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 09:01:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,298 INFO L225 Difference]: With dead ends: 264 [2019-10-22 09:01:24,298 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 09:01:24,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 09:01:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-10-22 09:01:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:01:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-10-22 09:01:24,310 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-10-22 09:01:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,310 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-10-22 09:01:24,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-10-22 09:01:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 09:01:24,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,312 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] [2019-10-22 09:01:24,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-10-22 09:01:24,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817998446] [2019-10-22 09:01:24,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:24,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817998446] [2019-10-22 09:01:24,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:24,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924569779] [2019-10-22 09:01:24,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,422 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-10-22 09:01:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,459 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-10-22 09:01:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 09:01:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,464 INFO L225 Difference]: With dead ends: 298 [2019-10-22 09:01:24,464 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 09:01:24,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 09:01:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 09:01:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 09:01:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-10-22 09:01:24,487 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-10-22 09:01:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,488 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-10-22 09:01:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-10-22 09:01:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 09:01:24,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,496 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] [2019-10-22 09:01:24,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-10-22 09:01:24,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110317753] [2019-10-22 09:01:24,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:01:24,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110317753] [2019-10-22 09:01:24,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:24,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184268578] [2019-10-22 09:01:24,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,635 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-10-22 09:01:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,885 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-10-22 09:01:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 09:01:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,887 INFO L225 Difference]: With dead ends: 369 [2019-10-22 09:01:24,887 INFO L226 Difference]: Without dead ends: 213 [2019-10-22 09:01:24,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-22 09:01:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-22 09:01:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 09:01:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-10-22 09:01:24,921 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-10-22 09:01:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,921 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-10-22 09:01:24,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-10-22 09:01:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 09:01:24,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,925 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] [2019-10-22 09:01:24,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-10-22 09:01:24,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255885291] [2019-10-22 09:01:24,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:01:24,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255885291] [2019-10-22 09:01:24,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:24,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961943547] [2019-10-22 09:01:24,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,993 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-10-22 09:01:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,136 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-10-22 09:01:25,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 09:01:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,138 INFO L225 Difference]: With dead ends: 424 [2019-10-22 09:01:25,139 INFO L226 Difference]: Without dead ends: 228 [2019-10-22 09:01:25,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-22 09:01:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-10-22 09:01:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-22 09:01:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-10-22 09:01:25,170 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-10-22 09:01:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,170 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-10-22 09:01:25,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-10-22 09:01:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:25,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,172 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] [2019-10-22 09:01:25,172 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-10-22 09:01:25,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928643215] [2019-10-22 09:01:25,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 09:01:25,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928643215] [2019-10-22 09:01:25,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714318678] [2019-10-22 09:01:25,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,257 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-10-22 09:01:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,405 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-10-22 09:01:25,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-22 09:01:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,407 INFO L225 Difference]: With dead ends: 463 [2019-10-22 09:01:25,407 INFO L226 Difference]: Without dead ends: 248 [2019-10-22 09:01:25,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-22 09:01:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-10-22 09:01:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-22 09:01:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-10-22 09:01:25,430 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-10-22 09:01:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,431 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-10-22 09:01:25,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-10-22 09:01:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:01:25,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,432 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] [2019-10-22 09:01:25,433 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-10-22 09:01:25,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141860921] [2019-10-22 09:01:25,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:01:25,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141860921] [2019-10-22 09:01:25,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139535017] [2019-10-22 09:01:25,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,520 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-10-22 09:01:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,560 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-10-22 09:01:25,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-22 09:01:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,565 INFO L225 Difference]: With dead ends: 694 [2019-10-22 09:01:25,565 INFO L226 Difference]: Without dead ends: 458 [2019-10-22 09:01:25,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-22 09:01:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-10-22 09:01:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-22 09:01:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-10-22 09:01:25,584 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-10-22 09:01:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,586 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-10-22 09:01:25,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-10-22 09:01:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 09:01:25,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,589 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,589 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-10-22 09:01:25,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890256838] [2019-10-22 09:01:25,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 09:01:25,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890256838] [2019-10-22 09:01:25,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800842972] [2019-10-22 09:01:25,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,643 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-10-22 09:01:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,683 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-10-22 09:01:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 09:01:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,687 INFO L225 Difference]: With dead ends: 673 [2019-10-22 09:01:25,687 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 09:01:25,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 09:01:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-10-22 09:01:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-10-22 09:01:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-10-22 09:01:25,705 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-10-22 09:01:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,706 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-10-22 09:01:25,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-10-22 09:01:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-22 09:01:25,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,716 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,716 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-10-22 09:01:25,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812674549] [2019-10-22 09:01:25,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 09:01:25,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812674549] [2019-10-22 09:01:25,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258071091] [2019-10-22 09:01:25,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,821 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-10-22 09:01:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,015 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-10-22 09:01:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-22 09:01:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,019 INFO L225 Difference]: With dead ends: 1483 [2019-10-22 09:01:26,019 INFO L226 Difference]: Without dead ends: 818 [2019-10-22 09:01:26,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-22 09:01:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-10-22 09:01:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-22 09:01:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-10-22 09:01:26,041 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-10-22 09:01:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,042 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-10-22 09:01:26,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-10-22 09:01:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-22 09:01:26,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,045 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-10-22 09:01:26,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601474781] [2019-10-22 09:01:26,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-22 09:01:26,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601474781] [2019-10-22 09:01:26,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:26,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939804586] [2019-10-22 09:01:26,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,112 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-10-22 09:01:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,279 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-10-22 09:01:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-22 09:01:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,283 INFO L225 Difference]: With dead ends: 1845 [2019-10-22 09:01:26,285 INFO L226 Difference]: Without dead ends: 1015 [2019-10-22 09:01:26,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-10-22 09:01:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-10-22 09:01:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 09:01:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-10-22 09:01:26,313 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-10-22 09:01:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,313 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-10-22 09:01:26,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-10-22 09:01:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-22 09:01:26,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,317 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,317 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-10-22 09:01:26,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896374522] [2019-10-22 09:01:26,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 09:01:26,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896374522] [2019-10-22 09:01:26,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:26,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112878328] [2019-10-22 09:01:26,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,446 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-10-22 09:01:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,479 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-10-22 09:01:26,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-22 09:01:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,484 INFO L225 Difference]: With dead ends: 2279 [2019-10-22 09:01:26,485 INFO L226 Difference]: Without dead ends: 1311 [2019-10-22 09:01:26,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-10-22 09:01:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-10-22 09:01:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-10-22 09:01:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-10-22 09:01:26,527 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-10-22 09:01:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,528 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-10-22 09:01:26,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-10-22 09:01:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 09:01:26,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,532 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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-10-22 09:01:26,532 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-10-22 09:01:26,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518531253] [2019-10-22 09:01:26,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:26,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518531253] [2019-10-22 09:01:26,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:26,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871535002] [2019-10-22 09:01:26,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,619 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-10-22 09:01:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,677 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-10-22 09:01:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-22 09:01:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,689 INFO L225 Difference]: With dead ends: 3667 [2019-10-22 09:01:26,689 INFO L226 Difference]: Without dead ends: 2365 [2019-10-22 09:01:26,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-10-22 09:01:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-10-22 09:01:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-10-22 09:01:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-10-22 09:01:26,770 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-10-22 09:01:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,770 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-10-22 09:01:26,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-10-22 09:01:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 09:01:26,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,776 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,776 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-10-22 09:01:26,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363846215] [2019-10-22 09:01:26,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:26,984 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:26,984 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:01:27,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:27 BoogieIcfgContainer [2019-10-22 09:01:27,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:27,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:27,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:27,099 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:27,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:23" (3/4) ... [2019-10-22 09:01:27,104 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:27,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:27,106 INFO L168 Benchmark]: Toolchain (without parser) took 5305.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 943.4 MB in the beginning and 931.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 207.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:27,108 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:27,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:27,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:27,110 INFO L168 Benchmark]: Boogie Preprocessor took 53.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:27,111 INFO L168 Benchmark]: RCFGBuilder took 797.43 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:27,111 INFO L168 Benchmark]: TraceAbstraction took 3890.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 931.4 MB in the end (delta: 146.1 MB). Peak memory consumption was 197.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:27,112 INFO L168 Benchmark]: Witness Printer took 5.51 ms. Allocated memory is still 1.2 GB. Free memory is still 931.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:27,114 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 486.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.31 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 53.48 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 797.43 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3890.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 931.4 MB in the end (delta: 146.1 MB). Peak memory consumption was 197.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.51 ms. Allocated memory is still 1.2 GB. Free memory is still 931.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 608]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 356. Possible FailurePath: [L617] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND TRUE blastFlag == 3 [L324] blastFlag = 4 [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND FALSE !(blastFlag == 5) [L351] COND FALSE !(ret <= 0) [L356] s__state = ag_X ^ ag_Y [L357] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND FALSE !(blastFlag == 3) [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND TRUE blastFlag == 5 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.8s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:29,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:29,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:29,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:29,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:29,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:29,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:29,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:29,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:29,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:29,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:29,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:29,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:29,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:29,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:29,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:29,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:29,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:29,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:29,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:29,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:29,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:29,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:29,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:29,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:29,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:29,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:29,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:29,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:29,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:29,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:29,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:29,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:29,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:29,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:29,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:29,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:29,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:29,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:29,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:29,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:29,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 09:01:29,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:29,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:29,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:29,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:29,640 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:29,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:29,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:29,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:29,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:29,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:29,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:29,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:29,641 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 09:01:29,641 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 09:01:29,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:29,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:29,642 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:29,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:29,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:29,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:29,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:29,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:29,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:29,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:29,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:29,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:29,643 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 09:01:29,643 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 09:01:29,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:29,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 09:01:29,644 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-10-22 09:01:29,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:29,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:29,712 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:29,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:29,715 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:29,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-10-22 09:01:29,780 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/47a9a369b/4255dd93957b4344b66b6393ffc35497/FLAG1179612a1 [2019-10-22 09:01:30,233 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:30,233 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-10-22 09:01:30,243 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/47a9a369b/4255dd93957b4344b66b6393ffc35497/FLAG1179612a1 [2019-10-22 09:01:30,569 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/data/47a9a369b/4255dd93957b4344b66b6393ffc35497 [2019-10-22 09:01:30,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:30,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:30,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:30,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:30,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:30,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:30,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219e3e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30, skipping insertion in model container [2019-10-22 09:01:30,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:30,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:30,631 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:30,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:30,868 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:30,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:30,948 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:30,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30 WrapperNode [2019-10-22 09:01:30,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:30,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:30,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:30,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:31,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:31,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:31,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:31,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:31,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:31,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:31,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:31,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:31,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:31,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:31,328 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:01:31,931 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 09:01:31,931 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 09:01:31,934 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:31,934 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:31,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:31 BoogieIcfgContainer [2019-10-22 09:01:31,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:31,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:31,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:31,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:31,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:30" (1/3) ... [2019-10-22 09:01:31,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571d5921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:31, skipping insertion in model container [2019-10-22 09:01:31,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (2/3) ... [2019-10-22 09:01:31,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571d5921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:31, skipping insertion in model container [2019-10-22 09:01:31,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:31" (3/3) ... [2019-10-22 09:01:31,947 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-10-22 09:01:31,956 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:31,963 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:31,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:32,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:32,007 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:32,009 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:32,009 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:32,009 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:32,010 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:32,010 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:32,010 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-22 09:01:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:01:32,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,037 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-10-22 09:01:32,039 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-10-22 09:01:32,052 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:32,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1771409138] [2019-10-22 09:01:32,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:32,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,221 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1771409138] [2019-10-22 09:01:32,236 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 09:01:32,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77061304] [2019-10-22 09:01:32,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:32,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:32,261 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-10-22 09:01:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,519 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-10-22 09:01:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:32,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:01:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,535 INFO L225 Difference]: With dead ends: 245 [2019-10-22 09:01:32,535 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 09:01:32,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 09:01:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 09:01:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 09:01:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-10-22 09:01:32,586 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-10-22 09:01:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,587 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-10-22 09:01:32,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-10-22 09:01:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 09:01:32,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,589 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] [2019-10-22 09:01:32,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:32,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-10-22 09:01:32,791 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:32,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [803894690] [2019-10-22 09:01:32,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:32,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,904 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803894690] [2019-10-22 09:01:32,910 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:32,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064862012] [2019-10-22 09:01:32,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:32,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:32,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:32,913 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-10-22 09:01:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,131 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-10-22 09:01:33,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:33,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 09:01:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,134 INFO L225 Difference]: With dead ends: 232 [2019-10-22 09:01:33,134 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 09:01:33,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 09:01:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-22 09:01:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 09:01:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-10-22 09:01:33,155 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-10-22 09:01:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,156 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-10-22 09:01:33,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-10-22 09:01:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 09:01:33,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,157 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] [2019-10-22 09:01:33,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:33,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-10-22 09:01:33,360 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:33,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1064902474] [2019-10-22 09:01:33,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:33,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:33,492 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:33,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064902474] [2019-10-22 09:01:33,504 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:33,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910777717] [2019-10-22 09:01:33,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:33,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:33,509 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-10-22 09:01:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,709 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-10-22 09:01:33,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:33,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 09:01:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,714 INFO L225 Difference]: With dead ends: 264 [2019-10-22 09:01:33,714 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 09:01:33,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 09:01:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-10-22 09:01:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:01:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-10-22 09:01:33,731 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-10-22 09:01:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,731 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-10-22 09:01:33,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-10-22 09:01:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 09:01:33,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,734 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] [2019-10-22 09:01:33,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:33,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-10-22 09:01:33,935 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:33,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [656115412] [2019-10-22 09:01:33,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:34,061 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:34,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656115412] [2019-10-22 09:01:34,073 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:34,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536188034] [2019-10-22 09:01:34,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:34,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:34,075 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-10-22 09:01:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,104 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-10-22 09:01:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:34,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 09:01:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,107 INFO L225 Difference]: With dead ends: 298 [2019-10-22 09:01:34,107 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 09:01:34,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 09:01:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 09:01:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 09:01:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-10-22 09:01:34,120 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-10-22 09:01:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,120 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-10-22 09:01:34,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-10-22 09:01:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 09:01:34,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,123 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] [2019-10-22 09:01:34,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:34,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-10-22 09:01:34,325 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:34,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [671112747] [2019-10-22 09:01:34,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:01:34,441 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:01:34,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671112747] [2019-10-22 09:01:34,458 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:34,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516539333] [2019-10-22 09:01:34,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:34,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:34,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:34,459 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-10-22 09:01:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,540 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-10-22 09:01:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:34,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-22 09:01:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,548 INFO L225 Difference]: With dead ends: 581 [2019-10-22 09:01:34,548 INFO L226 Difference]: Without dead ends: 426 [2019-10-22 09:01:34,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-22 09:01:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-10-22 09:01:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-22 09:01:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-10-22 09:01:34,596 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-10-22 09:01:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,597 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-10-22 09:01:34,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-10-22 09:01:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:01:34,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,599 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-10-22 09:01:34,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:34,800 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-10-22 09:01:34,801 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:34,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1113843124] [2019-10-22 09:01:34,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:01:34,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:01:34,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1113843124] [2019-10-22 09:01:34,933 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 09:01:34,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948759002] [2019-10-22 09:01:34,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:34,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:34,935 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-10-22 09:01:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,989 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-10-22 09:01:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:34,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:01:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,993 INFO L225 Difference]: With dead ends: 869 [2019-10-22 09:01:34,993 INFO L226 Difference]: Without dead ends: 452 [2019-10-22 09:01:34,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-22 09:01:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-10-22 09:01:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-22 09:01:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-10-22 09:01:35,067 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-10-22 09:01:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,067 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-10-22 09:01:35,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-10-22 09:01:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 09:01:35,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,074 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:35,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:35,275 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-10-22 09:01:35,276 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:35,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1067249719] [2019-10-22 09:01:35,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 09:01:35,447 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 09:01:35,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1067249719] [2019-10-22 09:01:35,465 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:35,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:35,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974439894] [2019-10-22 09:01:35,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:35,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:35,466 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-10-22 09:01:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:35,744 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-10-22 09:01:35,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:35,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-22 09:01:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:35,749 INFO L225 Difference]: With dead ends: 1066 [2019-10-22 09:01:35,749 INFO L226 Difference]: Without dead ends: 649 [2019-10-22 09:01:35,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-22 09:01:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-10-22 09:01:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-22 09:01:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-10-22 09:01:35,787 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-10-22 09:01:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,787 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-10-22 09:01:35,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-10-22 09:01:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 09:01:35,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,789 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:35,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:35,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-10-22 09:01:35,990 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:35,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [840027382] [2019-10-22 09:01:35,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:36,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-22 09:01:36,119 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-22 09:01:36,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [840027382] [2019-10-22 09:01:36,131 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:36,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:36,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763949475] [2019-10-22 09:01:36,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:36,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:36,132 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-10-22 09:01:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:36,275 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-10-22 09:01:36,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:36,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-22 09:01:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:36,278 INFO L225 Difference]: With dead ends: 1291 [2019-10-22 09:01:36,279 INFO L226 Difference]: Without dead ends: 697 [2019-10-22 09:01:36,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-22 09:01:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-10-22 09:01:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-22 09:01:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-10-22 09:01:36,298 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-10-22 09:01:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:36,299 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-10-22 09:01:36,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-10-22 09:01:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-22 09:01:36,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:36,301 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 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] [2019-10-22 09:01:36,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:36,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-10-22 09:01:36,502 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:36,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [766387534] [2019-10-22 09:01:36,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:36,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 09:01:36,623 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 09:01:36,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [766387534] [2019-10-22 09:01:36,643 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:36,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:36,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186456512] [2019-10-22 09:01:36,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:36,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:36,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:36,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:36,644 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-10-22 09:01:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:36,678 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-10-22 09:01:36,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:36,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-22 09:01:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:36,691 INFO L225 Difference]: With dead ends: 1565 [2019-10-22 09:01:36,692 INFO L226 Difference]: Without dead ends: 914 [2019-10-22 09:01:36,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-22 09:01:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-10-22 09:01:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-10-22 09:01:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-10-22 09:01:36,726 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-10-22 09:01:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:36,727 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-10-22 09:01:36,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-10-22 09:01:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-22 09:01:36,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:36,733 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:36,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:36,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-10-22 09:01:36,934 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:36,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [93835131] [2019-10-22 09:01:36,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:37,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-22 09:01:37,038 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-22 09:01:37,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [93835131] [2019-10-22 09:01:37,060 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:37,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:37,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127695521] [2019-10-22 09:01:37,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:37,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:37,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:37,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:37,062 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-10-22 09:01:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,240 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-10-22 09:01:37,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:37,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-22 09:01:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,244 INFO L225 Difference]: With dead ends: 1847 [2019-10-22 09:01:37,244 INFO L226 Difference]: Without dead ends: 989 [2019-10-22 09:01:37,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-10-22 09:01:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-10-22 09:01:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 09:01:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-10-22 09:01:37,296 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-10-22 09:01:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,296 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-10-22 09:01:37,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-10-22 09:01:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 09:01:37,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,300 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 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-10-22 09:01:37,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:37,501 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,501 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-10-22 09:01:37,502 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:37,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2121081397] [2019-10-22 09:01:37,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:37,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-22 09:01:37,632 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-22 09:01:37,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121081397] [2019-10-22 09:01:37,653 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:37,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:37,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120579965] [2019-10-22 09:01:37,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:37,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:37,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:37,654 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-10-22 09:01:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,700 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-10-22 09:01:37,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:37,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 09:01:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,706 INFO L225 Difference]: With dead ends: 2432 [2019-10-22 09:01:37,706 INFO L226 Difference]: Without dead ends: 1511 [2019-10-22 09:01:37,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-10-22 09:01:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-10-22 09:01:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-10-22 09:01:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-10-22 09:01:37,751 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-10-22 09:01:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,752 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-10-22 09:01:37,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-10-22 09:01:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 09:01:37,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,756 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 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-10-22 09:01:37,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:37,957 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-10-22 09:01:37,958 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:37,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1325784370] [2019-10-22 09:01:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:38,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-22 09:01:38,099 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-22 09:01:38,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1325784370] [2019-10-22 09:01:38,123 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:38,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 09:01:38,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178537798] [2019-10-22 09:01:38,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:38,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:38,125 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-10-22 09:01:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,171 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-10-22 09:01:38,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:38,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 09:01:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,176 INFO L225 Difference]: With dead ends: 2354 [2019-10-22 09:01:38,177 INFO L226 Difference]: Without dead ends: 1513 [2019-10-22 09:01:38,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-10-22 09:01:38,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-10-22 09:01:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-10-22 09:01:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-10-22 09:01:38,221 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-10-22 09:01:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,221 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-10-22 09:01:38,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-10-22 09:01:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 09:01:38,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,225 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:38,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:38,426 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-10-22 09:01:38,427 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:38,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1012215607] [2019-10-22 09:01:38,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:38,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 09:01:38,565 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 09:01:38,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012215607] [2019-10-22 09:01:38,587 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:38,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:38,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706914394] [2019-10-22 09:01:38,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:38,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:38,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:38,589 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-10-22 09:01:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,861 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-10-22 09:01:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:38,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-22 09:01:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,867 INFO L225 Difference]: With dead ends: 3056 [2019-10-22 09:01:38,867 INFO L226 Difference]: Without dead ends: 1603 [2019-10-22 09:01:38,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-10-22 09:01:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-10-22 09:01:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-22 09:01:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-10-22 09:01:38,928 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-10-22 09:01:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,929 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-10-22 09:01:38,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-10-22 09:01:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 09:01:38,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,935 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:39,136 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-10-22 09:01:39,137 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:39,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [881436422] [2019-10-22 09:01:39,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:39,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-22 09:01:39,411 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-22 09:01:39,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [881436422] [2019-10-22 09:01:39,468 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:39,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-22 09:01:39,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730887307] [2019-10-22 09:01:39,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:39,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:39,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:39,470 INFO L87 Difference]: Start difference. First operand 1557 states and 2119 transitions. Second operand 8 states. [2019-10-22 09:01:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,207 INFO L93 Difference]: Finished difference Result 3568 states and 4898 transitions. [2019-10-22 09:01:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:40,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-10-22 09:01:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,215 INFO L225 Difference]: With dead ends: 3568 [2019-10-22 09:01:40,215 INFO L226 Difference]: Without dead ends: 2069 [2019-10-22 09:01:40,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:01:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-10-22 09:01:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1891. [2019-10-22 09:01:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-10-22 09:01:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2555 transitions. [2019-10-22 09:01:40,273 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2555 transitions. Word has length 195 [2019-10-22 09:01:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,273 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 2555 transitions. [2019-10-22 09:01:40,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2555 transitions. [2019-10-22 09:01:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-22 09:01:40,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,278 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:40,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1241778267, now seen corresponding path program 1 times [2019-10-22 09:01:40,480 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:40,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [924477567] [2019-10-22 09:01:40,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:40,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-22 09:01:40,629 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-22 09:01:40,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [924477567] [2019-10-22 09:01:40,661 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:40,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409248931] [2019-10-22 09:01:40,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:40,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:40,663 INFO L87 Difference]: Start difference. First operand 1891 states and 2555 transitions. Second operand 4 states. [2019-10-22 09:01:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,940 INFO L93 Difference]: Finished difference Result 3965 states and 5428 transitions. [2019-10-22 09:01:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:40,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-10-22 09:01:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,947 INFO L225 Difference]: With dead ends: 3965 [2019-10-22 09:01:40,948 INFO L226 Difference]: Without dead ends: 2132 [2019-10-22 09:01:40,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-10-22 09:01:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2087. [2019-10-22 09:01:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-10-22 09:01:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2779 transitions. [2019-10-22 09:01:41,004 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2779 transitions. Word has length 220 [2019-10-22 09:01:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:41,004 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 2779 transitions. [2019-10-22 09:01:41,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2779 transitions. [2019-10-22 09:01:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-22 09:01:41,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:41,009 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:41,210 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1291955765, now seen corresponding path program 1 times [2019-10-22 09:01:41,210 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:41,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1911719560] [2019-10-22 09:01:41,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:41,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-22 09:01:41,321 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-22 09:01:41,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1911719560] [2019-10-22 09:01:41,348 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:41,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:41,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775494000] [2019-10-22 09:01:41,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:41,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:41,349 INFO L87 Difference]: Start difference. First operand 2087 states and 2779 transitions. Second operand 4 states. [2019-10-22 09:01:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:41,556 INFO L93 Difference]: Finished difference Result 4354 states and 5895 transitions. [2019-10-22 09:01:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:41,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-10-22 09:01:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:41,563 INFO L225 Difference]: With dead ends: 4354 [2019-10-22 09:01:41,563 INFO L226 Difference]: Without dead ends: 2325 [2019-10-22 09:01:41,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-10-22 09:01:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2304. [2019-10-22 09:01:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-10-22 09:01:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3024 transitions. [2019-10-22 09:01:41,622 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3024 transitions. Word has length 231 [2019-10-22 09:01:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 3024 transitions. [2019-10-22 09:01:41,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3024 transitions. [2019-10-22 09:01:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-22 09:01:41,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:41,627 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:41,828 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1875116247, now seen corresponding path program 1 times [2019-10-22 09:01:41,829 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:41,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [544206243] [2019-10-22 09:01:41,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:41,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-22 09:01:41,978 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-10-22 09:01:42,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [544206243] [2019-10-22 09:01:42,024 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:42,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941714310] [2019-10-22 09:01:42,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:42,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:42,026 INFO L87 Difference]: Start difference. First operand 2304 states and 3024 transitions. Second operand 4 states. [2019-10-22 09:01:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,311 INFO L93 Difference]: Finished difference Result 4872 states and 6497 transitions. [2019-10-22 09:01:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:42,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-10-22 09:01:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,319 INFO L225 Difference]: With dead ends: 4872 [2019-10-22 09:01:42,320 INFO L226 Difference]: Without dead ends: 2626 [2019-10-22 09:01:42,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2019-10-22 09:01:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2556. [2019-10-22 09:01:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2019-10-22 09:01:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3304 transitions. [2019-10-22 09:01:42,412 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3304 transitions. Word has length 261 [2019-10-22 09:01:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,413 INFO L462 AbstractCegarLoop]: Abstraction has 2556 states and 3304 transitions. [2019-10-22 09:01:42,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3304 transitions. [2019-10-22 09:01:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-22 09:01:42,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,418 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:42,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:42,618 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash -362194243, now seen corresponding path program 1 times [2019-10-22 09:01:42,619 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:42,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1941077060] [2019-10-22 09:01:42,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:42,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-22 09:01:42,771 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-22 09:01:42,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1941077060] [2019-10-22 09:01:42,803 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:42,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593724050] [2019-10-22 09:01:42,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:42,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:42,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:42,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:42,804 INFO L87 Difference]: Start difference. First operand 2556 states and 3304 transitions. Second operand 4 states. [2019-10-22 09:01:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,936 INFO L93 Difference]: Finished difference Result 9819 states and 12722 transitions. [2019-10-22 09:01:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:42,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-10-22 09:01:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,955 INFO L225 Difference]: With dead ends: 9819 [2019-10-22 09:01:42,960 INFO L226 Difference]: Without dead ends: 7321 [2019-10-22 09:01:42,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7321 states. [2019-10-22 09:01:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7321 to 7317. [2019-10-22 09:01:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7317 states. [2019-10-22 09:01:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7317 states to 7317 states and 9471 transitions. [2019-10-22 09:01:43,147 INFO L78 Accepts]: Start accepts. Automaton has 7317 states and 9471 transitions. Word has length 262 [2019-10-22 09:01:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,148 INFO L462 AbstractCegarLoop]: Abstraction has 7317 states and 9471 transitions. [2019-10-22 09:01:43,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7317 states and 9471 transitions. [2019-10-22 09:01:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-22 09:01:43,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,159 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:43,360 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1596519917, now seen corresponding path program 1 times [2019-10-22 09:01:43,360 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:43,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1427958730] [2019-10-22 09:01:43,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:43,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-10-22 09:01:43,516 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-10-22 09:01:43,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1427958730] [2019-10-22 09:01:43,561 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:43,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243626896] [2019-10-22 09:01:43,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:43,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:43,563 INFO L87 Difference]: Start difference. First operand 7317 states and 9471 transitions. Second operand 4 states. [2019-10-22 09:01:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,817 INFO L93 Difference]: Finished difference Result 15017 states and 19517 transitions. [2019-10-22 09:01:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:43,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-10-22 09:01:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,834 INFO L225 Difference]: With dead ends: 15017 [2019-10-22 09:01:43,834 INFO L226 Difference]: Without dead ends: 7758 [2019-10-22 09:01:43,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2019-10-22 09:01:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 7548. [2019-10-22 09:01:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7548 states. [2019-10-22 09:01:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7548 states to 7548 states and 9716 transitions. [2019-10-22 09:01:44,011 INFO L78 Accepts]: Start accepts. Automaton has 7548 states and 9716 transitions. Word has length 286 [2019-10-22 09:01:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,011 INFO L462 AbstractCegarLoop]: Abstraction has 7548 states and 9716 transitions. [2019-10-22 09:01:44,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7548 states and 9716 transitions. [2019-10-22 09:01:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-22 09:01:44,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,020 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:44,221 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash -49494058, now seen corresponding path program 1 times [2019-10-22 09:01:44,222 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:44,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1941579401] [2019-10-22 09:01:44,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:44,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-22 09:01:44,394 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-10-22 09:01:44,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1941579401] [2019-10-22 09:01:44,445 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:44,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287219253] [2019-10-22 09:01:44,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:44,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:44,446 INFO L87 Difference]: Start difference. First operand 7548 states and 9716 transitions. Second operand 4 states. [2019-10-22 09:01:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,769 INFO L93 Difference]: Finished difference Result 16025 states and 20952 transitions. [2019-10-22 09:01:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:44,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-10-22 09:01:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,788 INFO L225 Difference]: With dead ends: 16025 [2019-10-22 09:01:44,788 INFO L226 Difference]: Without dead ends: 8535 [2019-10-22 09:01:44,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2019-10-22 09:01:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 8325. [2019-10-22 09:01:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8325 states. [2019-10-22 09:01:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 10577 transitions. [2019-10-22 09:01:44,937 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 10577 transitions. Word has length 298 [2019-10-22 09:01:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,937 INFO L462 AbstractCegarLoop]: Abstraction has 8325 states and 10577 transitions. [2019-10-22 09:01:44,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 10577 transitions. [2019-10-22 09:01:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-22 09:01:44,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,944 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:45,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:45,144 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash -549291359, now seen corresponding path program 1 times [2019-10-22 09:01:45,145 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:45,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [743369992] [2019-10-22 09:01:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:45,294 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:01:45,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [743369992] [2019-10-22 09:01:45,345 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:45,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:45,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767965715] [2019-10-22 09:01:45,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:45,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:45,346 INFO L87 Difference]: Start difference. First operand 8325 states and 10577 transitions. Second operand 4 states. [2019-10-22 09:01:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,573 INFO L93 Difference]: Finished difference Result 17636 states and 22773 transitions. [2019-10-22 09:01:45,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:45,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-10-22 09:01:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:45,590 INFO L225 Difference]: With dead ends: 17636 [2019-10-22 09:01:45,591 INFO L226 Difference]: Without dead ends: 9369 [2019-10-22 09:01:45,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2019-10-22 09:01:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 9180. [2019-10-22 09:01:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9180 states. [2019-10-22 09:01:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 11516 transitions. [2019-10-22 09:01:45,804 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 11516 transitions. Word has length 335 [2019-10-22 09:01:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:45,804 INFO L462 AbstractCegarLoop]: Abstraction has 9180 states and 11516 transitions. [2019-10-22 09:01:45,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 11516 transitions. [2019-10-22 09:01:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-22 09:01:45,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:45,811 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 09:01:46,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:46,012 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1440496778, now seen corresponding path program 1 times [2019-10-22 09:01:46,013 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:46,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1875543896] [2019-10-22 09:01:46,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-22 09:01:46,190 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-22 09:01:46,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1875543896] [2019-10-22 09:01:46,264 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:46,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-22 09:01:46,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680456871] [2019-10-22 09:01:46,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:46,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:46,266 INFO L87 Difference]: Start difference. First operand 9180 states and 11516 transitions. Second operand 6 states. [2019-10-22 09:01:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,935 INFO L93 Difference]: Finished difference Result 19024 states and 23829 transitions. [2019-10-22 09:01:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:01:46,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2019-10-22 09:01:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,947 INFO L225 Difference]: With dead ends: 19024 [2019-10-22 09:01:46,947 INFO L226 Difference]: Without dead ends: 6577 [2019-10-22 09:01:46,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2019-10-22 09:01:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6343. [2019-10-22 09:01:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6343 states. [2019-10-22 09:01:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 7946 transitions. [2019-10-22 09:01:47,115 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 7946 transitions. Word has length 358 [2019-10-22 09:01:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,115 INFO L462 AbstractCegarLoop]: Abstraction has 6343 states and 7946 transitions. [2019-10-22 09:01:47,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 7946 transitions. [2019-10-22 09:01:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-10-22 09:01:47,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,125 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 15, 14, 13, 13, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:47,326 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash -875382811, now seen corresponding path program 1 times [2019-10-22 09:01:47,327 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:47,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1418729734] [2019-10-22 09:01:47,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-10-22 09:01:47,583 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-10-22 09:01:47,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1418729734] [2019-10-22 09:01:47,710 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:47,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325612978] [2019-10-22 09:01:47,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:47,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:47,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:47,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:47,712 INFO L87 Difference]: Start difference. First operand 6343 states and 7946 transitions. Second operand 4 states. [2019-10-22 09:01:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,001 INFO L93 Difference]: Finished difference Result 12996 states and 16509 transitions. [2019-10-22 09:01:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:48,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 543 [2019-10-22 09:01:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:48,012 INFO L225 Difference]: With dead ends: 12996 [2019-10-22 09:01:48,012 INFO L226 Difference]: Without dead ends: 6079 [2019-10-22 09:01:48,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2019-10-22 09:01:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 6043. [2019-10-22 09:01:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6043 states. [2019-10-22 09:01:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6043 states to 6043 states and 7526 transitions. [2019-10-22 09:01:48,138 INFO L78 Accepts]: Start accepts. Automaton has 6043 states and 7526 transitions. Word has length 543 [2019-10-22 09:01:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:48,139 INFO L462 AbstractCegarLoop]: Abstraction has 6043 states and 7526 transitions. [2019-10-22 09:01:48,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 6043 states and 7526 transitions. [2019-10-22 09:01:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-10-22 09:01:48,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,146 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:48,347 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1765106863, now seen corresponding path program 1 times [2019-10-22 09:01:48,348 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:48,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1125375052] [2019-10-22 09:01:48,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-10-22 09:01:48,624 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-10-22 09:01:48,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125375052] [2019-10-22 09:01:48,891 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:48,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-22 09:01:48,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186548730] [2019-10-22 09:01:48,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:48,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:48,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:48,892 INFO L87 Difference]: Start difference. First operand 6043 states and 7526 transitions. Second operand 6 states. [2019-10-22 09:01:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:49,098 INFO L93 Difference]: Finished difference Result 6256 states and 7796 transitions. [2019-10-22 09:01:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:49,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 618 [2019-10-22 09:01:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:49,099 INFO L225 Difference]: With dead ends: 6256 [2019-10-22 09:01:49,099 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:49,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1232 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:49,104 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 618 [2019-10-22 09:01:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:49,104 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:49,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:49,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:49,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:49,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:01:49,494 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-10-22 09:01:49,850 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 124 [2019-10-22 09:01:50,166 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-10-22 09:01:50,545 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-22 09:01:50,843 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-10-22 09:01:50,991 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2019-10-22 09:01:51,139 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-22 09:01:51,545 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-10-22 09:01:52,410 WARN L191 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2019-10-22 09:01:52,552 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-10-22 09:01:52,696 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-22 09:01:52,699 INFO L446 ceAbstractionStarter]: At program point L597(lines 92 598) the Hoare annotation is: true [2019-10-22 09:01:52,699 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 541) no Hoare annotation was computed. [2019-10-22 09:01:52,699 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 552) no Hoare annotation was computed. [2019-10-22 09:01:52,699 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 563) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L367-2(lines 367 371) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L301-1(lines 301 315) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L439 ceAbstractionStarter]: At program point L202(lines 99 564) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32))) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) [2019-10-22 09:01:52,700 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 542) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse1 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8 .cse9 .cse10)) (and .cse0 (and .cse3 .cse4 .cse5 .cse6 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 .cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse9 .cse10) .cse1 .cse2))) [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 594) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 591) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 341) no Hoare annotation was computed. [2019-10-22 09:01:52,700 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 540) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 551) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 562) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 577) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L568-2(lines 567 589) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 552) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse8 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse10))) [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-10-22 09:01:52,701 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 303 315) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 574) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 443) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 277) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 539) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 550) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L207-2(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 561) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 476) no Hoare annotation was computed. [2019-10-22 09:01:52,702 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 540) the Hoare annotation is: (let ((.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse8) .cse9 .cse10) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 (and .cse3 (not .cse2) .cse4 .cse11 .cse6 .cse8) .cse9 .cse10)))) [2019-10-22 09:01:52,702 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L506-1(lines 506 510) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 248) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 538) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 549) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 560) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 550) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse10))) [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-10-22 09:01:52,703 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 537) no Hoare annotation was computed. [2019-10-22 09:01:52,704 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 548) no Hoare annotation was computed. [2019-10-22 09:01:52,704 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 559) no Hoare annotation was computed. [2019-10-22 09:01:52,704 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-10-22 09:01:52,704 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-10-22 09:01:52,704 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 538) the Hoare annotation is: (let ((.cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse11 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse4 (and .cse0 (and .cse2 .cse3 (not .cse1) .cse5 .cse7 .cse8 .cse10) .cse11)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9 .cse10) .cse11))) [2019-10-22 09:01:52,704 INFO L439 ceAbstractionStarter]: At program point L115(lines 111 560) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) [2019-10-22 09:01:52,704 INFO L439 ceAbstractionStarter]: At program point L347(lines 65 614) the Hoare annotation is: false [2019-10-22 09:01:52,704 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-10-22 09:01:52,705 INFO L446 ceAbstractionStarter]: At program point L612(lines 65 614) the Hoare annotation is: true [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 536) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 547) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 558) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L446 ceAbstractionStarter]: At program point L613(lines 8 615) the Hoare annotation is: true [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 452) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:01:52,706 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 236) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 535) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 546) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L443 ceAbstractionStarter]: For program point L219-2(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 557) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-10-22 09:01:52,707 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 536) the Hoare annotation is: (let ((.cse12 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (let ((.cse2 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse0 (and .cse12 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse10 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse13 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse11 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (let ((.cse1 (not .cse9))) (or (and .cse0 .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse6 .cse7 .cse8)))) (and .cse9 .cse10 .cse4 .cse5 .cse11 .cse7 .cse2 .cse3 (and .cse12 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) .cse13 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6 .cse8) (and .cse2 .cse9 .cse0 .cse10 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11 .cse7 .cse8)))) [2019-10-22 09:01:52,707 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 558) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse10 .cse11) (and .cse7 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse8 .cse2 .cse3 .cse4 .cse10 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse11))) [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 497) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 226) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 534) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 545) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 556) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:01:52,708 INFO L439 ceAbstractionStarter]: At program point L190(lines 189 534) the Hoare annotation is: (let ((.cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (not .cse0) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-10-22 09:01:52,708 INFO L439 ceAbstractionStarter]: At program point L157(lines 147 548) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10))) [2019-10-22 09:01:52,709 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 493) no Hoare annotation was computed. [2019-10-22 09:01:52,709 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 466) no Hoare annotation was computed. [2019-10-22 09:01:52,709 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 466) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 265) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 394) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 533) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 544) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 555) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 65 614) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 463) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-10-22 09:01:52,710 INFO L446 ceAbstractionStarter]: At program point L193(lines 192 533) the Hoare annotation is: true [2019-10-22 09:01:52,711 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 556) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7) (and .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse6 .cse0 .cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0) (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse5 .cse7))) [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 264) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L260-2(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L446 ceAbstractionStarter]: At program point L624(lines 616 626) the Hoare annotation is: true [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 543) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 554) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 565) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 431) no Hoare annotation was computed. [2019-10-22 09:01:52,711 INFO L443 ceAbstractionStarter]: For program point L427-2(lines 197 529) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L446 ceAbstractionStarter]: At program point L196(lines 195 532) the Hoare annotation is: true [2019-10-22 09:01:52,712 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 544) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse2 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse3 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 (and .cse4 .cse5 .cse6 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9) .cse2 .cse3 .cse10))) [2019-10-22 09:01:52,712 INFO L439 ceAbstractionStarter]: At program point L97(lines 96 565) the Hoare annotation is: (and (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) [2019-10-22 09:01:52,712 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 401) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L443 ceAbstractionStarter]: For program point L396-2(lines 396 401) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 542) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 553) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 564) no Hoare annotation was computed. [2019-10-22 09:01:52,712 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 554) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-10-22 09:01:52,714 INFO L439 ceAbstractionStarter]: At program point L530(lines 93 596) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse14 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (let ((.cse20 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse11 (not .cse14)) (.cse5 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse12 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse22 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse16 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse19 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse13 (not .cse0)) (.cse18 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse4 (= (_ bv4448 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse21 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse17 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse23 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse25 (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse24 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12) (and (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse13 .cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse14) (and .cse0 .cse15 .cse16 .cse3 .cse2 .cse17) (and .cse13 .cse18 .cse3 .cse19 .cse2 .cse17) (and .cse0 .cse20 .cse1 .cse2 .cse3) (and (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse21 .cse13 .cse1) (and .cse0 .cse15 .cse3 .cse22 .cse2 .cse17) (and .cse0 .cse15 .cse3 .cse21 .cse2 .cse17) (and .cse0 .cse15 .cse3 .cse20 .cse2 .cse17) (and .cse0 .cse6 .cse8 .cse15 .cse9 .cse3 .cse11 .cse5 .cse7 .cse2 .cse17 .cse10 .cse12) (and .cse0 .cse22 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse16 .cse3) (and .cse13 .cse1 .cse16) (and .cse13 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse19 .cse13 .cse1 .cse18) (and .cse0 .cse15 .cse2 .cse17 .cse3 .cse4) (and .cse0 .cse15 .cse3 .cse2 .cse23 .cse17) (and .cse21 .cse1 .cse2 .cse3) (and .cse0 .cse15 .cse3 .cse2 .cse17 .cse24) (and .cse0 .cse15 .cse3 .cse25 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse3) (and .cse0 .cse1 (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse25 .cse1 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse24)))) [2019-10-22 09:01:52,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:52 BoogieIcfgContainer [2019-10-22 09:01:52,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:52,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:52,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:52,764 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:52,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:31" (3/4) ... [2019-10-22 09:01:52,767 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:52,788 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 09:01:52,790 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:52,885 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_48316fa3-0764-4243-ade7-d815649cc118/bin/uautomizer/witness.graphml [2019-10-22 09:01:52,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:52,887 INFO L168 Benchmark]: Toolchain (without parser) took 22313.49 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 901.3 MB). Free memory was 945.6 MB in the beginning and 948.5 MB in the end (delta: -2.9 MB). Peak memory consumption was 898.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,887 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:52,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.77 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 929.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 929.5 MB in the beginning and 1.2 GB in the end (delta: -232.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,888 INFO L168 Benchmark]: Boogie Preprocessor took 63.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,888 INFO L168 Benchmark]: RCFGBuilder took 800.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,888 INFO L168 Benchmark]: TraceAbstraction took 20824.98 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 735.1 MB). Free memory was 1.1 GB in the beginning and 948.5 MB in the end (delta: 155.6 MB). Peak memory consumption was 890.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,888 INFO L168 Benchmark]: Witness Printer took 122.27 ms. Allocated memory is still 1.9 GB. Free memory was 948.5 MB in the beginning and 948.5 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-10-22 09:01:52,890 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 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.77 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 929.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 929.5 MB in the beginning and 1.2 GB in the end (delta: -232.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 800.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20824.98 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 735.1 MB). Free memory was 1.1 GB in the beginning and 948.5 MB in the end (delta: 155.6 MB). Peak memory consumption was 890.7 MB. Max. memory is 11.5 GB. * Witness Printer took 122.27 ms. Allocated memory is still 1.9 GB. Free memory was 948.5 MB in the beginning and 948.5 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: 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: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && (((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) || ((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state))) || (!(4401bv32 == s__state) && (((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((!(4369bv32 == s__state) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(4401bv32 == s__state) && ((((!(4400bv32 == s__state) && 2bv32 == blastFlag) && !(s__hit == 0bv32)) && 4560bv32 == s__state) || (((((((((!(4099bv32 == s__state) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(s__hit == 0bv32)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(4368bv32 == s__s3__tmp__next_state___0)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)))) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && !(4400bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && (((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && !(4096bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) || (((4352bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32)) || ((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((!(4099bv32 == s__state) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && (((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || (((!(4099bv32 == s__state) && ((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((!(4099bv32 == s__state) && ((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) || ((!(4401bv32 == s__state) && !(4400bv32 == s__state)) && (!(4099bv32 == s__state) && (((((!(4096bv32 == s__state) && !(4369bv32 == s__state)) && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state))) || ((!(4099bv32 == s__state) && (((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ~bvadd64(s__state, 4294955004bv32) == 0bv32 && 0bv32 == blastFlag - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4448bv32 == s__state) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((4352bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32)) || (0bv32 == blastFlag && 4368bv32 == s__state)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 4512bv32 == s__state) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((!(s__hit == 0bv32) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y) && ~bvadd64(s__state, 4294967293bv32) == 0bv32) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((s__hit == 0bv32 && 4496bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (1bv32 == blastFlag && 4384bv32 == s__state)) || ((4528bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4480bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4528bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4496bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || ((((s__hit == 0bv32 && 4480bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((2bv32 == blastFlag && 65535bv32 == ag_X) && 4512bv32 == s__state) && 61087bv32 == ag_Y)) || ((!(s__hit == 0bv32) && 2bv32 == blastFlag) && 4512bv32 == s__state)) || ((!(s__hit == 0bv32) && 4560bv32 == s__state) && 2bv32 == blastFlag)) || (((~bvadd64(s__state, 4294967293bv32) == 0bv32 && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(4368bv32 == s__s3__tmp__next_state___0))) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && 4448bv32 == s__state)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && 4464bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((4528bv32 == s__state && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 4432bv32 == s__state)) || ((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4416bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 4464bv32 == s__state) && 61087bv32 == ag_Y)) || ((s__hit == 0bv32 && 2bv32 == blastFlag) && 4400bv32 == s__state)) || (((s__hit == 0bv32 && 4416bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4432bv32 == s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && (((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) || (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || (((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 1bv32 == blastFlag) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: SAFE, OverallTime: 20.7s, OverallIterations: 24, TraceHistogramMax: 22, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, HoareTripleCheckerStatistics: 4322 SDtfs, 3404 SDslu, 3841 SDs, 0 SdLazy, 3752 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9836 GetRequests, 9781 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 263 NumberOfFragments, 2104 HoareAnnotationTreeSize, 23 FomulaSimplifications, 10070 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 23 FomulaSimplificationsInter, 5527 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 4933 NumberOfCodeBlocks, 4933 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9818 ConstructedInterpolants, 0 QuantifiedInterpolants, 3880007 SizeOfPredicates, 20 NumberOfNonLiveVariables, 6480 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 38264/38368 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...