./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_1.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/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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 008a1a21da249b9d9d0b9660845bc4112d6c99e8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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 008a1a21da249b9d9d0b9660845bc4112d6c99e8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:20:02,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:20:02,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:20:02,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:20:02,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:20:02,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:20:02,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:20:02,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:20:02,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:20:02,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:20:02,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:20:02,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:20:02,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:20:02,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:20:02,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:20:02,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:20:02,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:20:02,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:20:02,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:20:02,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:20:02,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:20:02,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:20:02,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:20:02,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:20:02,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:20:02,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:20:02,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:20:02,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:20:02,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:20:02,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:20:02,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:20:02,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:20:02,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:20:02,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:20:02,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:20:02,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:20:02,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:20:02,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:20:02,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:20:02,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:20:02,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:20:02,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:20:02,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:20:02,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:20:02,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:20:02,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:20:02,289 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:20:02,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:20:02,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:20:02,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:20:02,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:20:02,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:20:02,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:20:02,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:20:02,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:20:02,293 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:20:02,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:20:02,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:20:02,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:20:02,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:20:02,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:20:02,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:20:02,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:20:02,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:20:02,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:20:02,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:20:02,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:20:02,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:20:02,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:20:02,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:20:02,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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 -> 008a1a21da249b9d9d0b9660845bc4112d6c99e8 [2019-11-15 22:20:02,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:20:02,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:20:02,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:20:02,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:20:02,362 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:20:02,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-1a.c [2019-11-15 22:20:02,424 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/5856b6753/ef4933470aae42ebabe93b555e9d597c/FLAG0a195040b [2019-11-15 22:20:02,893 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:20:02,893 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-1a.c [2019-11-15 22:20:02,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/5856b6753/ef4933470aae42ebabe93b555e9d597c/FLAG0a195040b [2019-11-15 22:20:03,154 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/5856b6753/ef4933470aae42ebabe93b555e9d597c [2019-11-15 22:20:03,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:20:03,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:20:03,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:20:03,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:20:03,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:20:03,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2f3044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03, skipping insertion in model container [2019-11-15 22:20:03,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,176 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:20:03,249 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:20:03,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:20:03,658 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:20:03,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:20:03,739 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:20:03,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03 WrapperNode [2019-11-15 22:20:03,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:20:03,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:20:03,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:20:03,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:20:03,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:20:03,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:20:03,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:20:03,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:20:03,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... [2019-11-15 22:20:03,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:20:03,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:20:03,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:20:03,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:20:03,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:20:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:20:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:20:04,096 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:20:04,768 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 22:20:04,768 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 22:20:04,770 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:20:04,770 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:20:04,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:20:04 BoogieIcfgContainer [2019-11-15 22:20:04,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:20:04,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:20:04,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:20:04,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:20:04,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:20:03" (1/3) ... [2019-11-15 22:20:04,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f64c111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:20:04, skipping insertion in model container [2019-11-15 22:20:04,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:03" (2/3) ... [2019-11-15 22:20:04,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f64c111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:20:04, skipping insertion in model container [2019-11-15 22:20:04,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:20:04" (3/3) ... [2019-11-15 22:20:04,784 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.BV.c.cil-1a.c [2019-11-15 22:20:04,793 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:20:04,799 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:20:04,809 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:20:04,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:20:04,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:20:04,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:20:04,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:20:04,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:20:04,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:20:04,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:20:04,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:20:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-15 22:20:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:20:04,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:04,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:04,870 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582915, now seen corresponding path program 1 times [2019-11-15 22:20:04,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:04,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606344930] [2019-11-15 22:20:04,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:04,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:04,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:05,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606344930] [2019-11-15 22:20:05,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:05,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:20:05,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531805202] [2019-11-15 22:20:05,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:05,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:05,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:05,097 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-15 22:20:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:05,320 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-11-15 22:20:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:05,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 22:20:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:05,333 INFO L225 Difference]: With dead ends: 247 [2019-11-15 22:20:05,333 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 22:20:05,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 22:20:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-15 22:20:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 22:20:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-11-15 22:20:05,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 23 [2019-11-15 22:20:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:05,379 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-11-15 22:20:05,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-11-15 22:20:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:20:05,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:05,381 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:05,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1463943324, now seen corresponding path program 1 times [2019-11-15 22:20:05,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:05,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456870020] [2019-11-15 22:20:05,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:05,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:05,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:05,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456870020] [2019-11-15 22:20:05,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:05,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:05,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993448705] [2019-11-15 22:20:05,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:05,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:05,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:05,453 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-11-15 22:20:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:05,665 INFO L93 Difference]: Finished difference Result 233 states and 355 transitions. [2019-11-15 22:20:05,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:05,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 22:20:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:05,668 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:20:05,668 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 22:20:05,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 22:20:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-15 22:20:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 22:20:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-11-15 22:20:05,684 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-11-15 22:20:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:05,685 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-11-15 22:20:05,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-11-15 22:20:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:20:05,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:05,688 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:05,688 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1876827341, now seen corresponding path program 1 times [2019-11-15 22:20:05,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:05,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815493244] [2019-11-15 22:20:05,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:05,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:05,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:20:05,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815493244] [2019-11-15 22:20:05,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:05,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:05,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557401339] [2019-11-15 22:20:05,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:05,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:05,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:05,788 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-11-15 22:20:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:05,976 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2019-11-15 22:20:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:05,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 22:20:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:05,979 INFO L225 Difference]: With dead ends: 266 [2019-11-15 22:20:05,979 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 22:20:05,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 22:20:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-15 22:20:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 22:20:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-11-15 22:20:05,994 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-11-15 22:20:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:05,994 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-11-15 22:20:05,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-11-15 22:20:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:20:06,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:06,002 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:06,002 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash -708368503, now seen corresponding path program 1 times [2019-11-15 22:20:06,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:06,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866703182] [2019-11-15 22:20:06,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:20:06,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866703182] [2019-11-15 22:20:06,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:06,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:06,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160973033] [2019-11-15 22:20:06,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:06,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:06,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:06,095 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2019-11-15 22:20:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:06,350 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-15 22:20:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:06,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 22:20:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:06,354 INFO L225 Difference]: With dead ends: 330 [2019-11-15 22:20:06,354 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 22:20:06,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 22:20:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2019-11-15 22:20:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 22:20:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2019-11-15 22:20:06,379 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2019-11-15 22:20:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:06,381 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2019-11-15 22:20:06,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2019-11-15 22:20:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:20:06,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:06,390 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:06,390 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1781160459, now seen corresponding path program 1 times [2019-11-15 22:20:06,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:06,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134704717] [2019-11-15 22:20:06,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:20:06,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134704717] [2019-11-15 22:20:06,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:06,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:06,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570596414] [2019-11-15 22:20:06,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:06,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:06,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:06,490 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand 3 states. [2019-11-15 22:20:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:06,633 INFO L93 Difference]: Finished difference Result 384 states and 549 transitions. [2019-11-15 22:20:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 22:20:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:06,636 INFO L225 Difference]: With dead ends: 384 [2019-11-15 22:20:06,636 INFO L226 Difference]: Without dead ends: 208 [2019-11-15 22:20:06,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:06,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-15 22:20:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-11-15 22:20:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-15 22:20:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2019-11-15 22:20:06,648 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2019-11-15 22:20:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:06,649 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2019-11-15 22:20:06,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2019-11-15 22:20:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:20:06,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:06,651 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:06,651 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1647185185, now seen corresponding path program 1 times [2019-11-15 22:20:06,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:06,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515119892] [2019-11-15 22:20:06,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 22:20:06,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515119892] [2019-11-15 22:20:06,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:06,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:06,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211378255] [2019-11-15 22:20:06,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:06,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:06,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:06,736 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 3 states. [2019-11-15 22:20:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:06,932 INFO L93 Difference]: Finished difference Result 423 states and 599 transitions. [2019-11-15 22:20:06,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:06,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:20:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:06,935 INFO L225 Difference]: With dead ends: 423 [2019-11-15 22:20:06,936 INFO L226 Difference]: Without dead ends: 228 [2019-11-15 22:20:06,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-15 22:20:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2019-11-15 22:20:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-15 22:20:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2019-11-15 22:20:06,957 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2019-11-15 22:20:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:06,959 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2019-11-15 22:20:06,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2019-11-15 22:20:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 22:20:06,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:06,971 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:06,972 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash -629532647, now seen corresponding path program 1 times [2019-11-15 22:20:06,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:06,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257787038] [2019-11-15 22:20:06,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:20:07,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257787038] [2019-11-15 22:20:07,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:07,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:07,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585033708] [2019-11-15 22:20:07,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:07,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:07,091 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand 3 states. [2019-11-15 22:20:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:07,143 INFO L93 Difference]: Finished difference Result 655 states and 906 transitions. [2019-11-15 22:20:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:07,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 22:20:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:07,148 INFO L225 Difference]: With dead ends: 655 [2019-11-15 22:20:07,148 INFO L226 Difference]: Without dead ends: 439 [2019-11-15 22:20:07,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-11-15 22:20:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-11-15 22:20:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-15 22:20:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 605 transitions. [2019-11-15 22:20:07,176 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 605 transitions. Word has length 103 [2019-11-15 22:20:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:07,177 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 605 transitions. [2019-11-15 22:20:07,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 605 transitions. [2019-11-15 22:20:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:20:07,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:07,185 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:07,185 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -548026749, now seen corresponding path program 1 times [2019-11-15 22:20:07,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:07,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230342101] [2019-11-15 22:20:07,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:07,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:07,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:20:07,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230342101] [2019-11-15 22:20:07,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:07,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:07,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036017094] [2019-11-15 22:20:07,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:07,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:07,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:07,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:07,276 INFO L87 Difference]: Start difference. First operand 439 states and 605 transitions. Second operand 3 states. [2019-11-15 22:20:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:07,322 INFO L93 Difference]: Finished difference Result 655 states and 903 transitions. [2019-11-15 22:20:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:07,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 22:20:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:07,327 INFO L225 Difference]: With dead ends: 655 [2019-11-15 22:20:07,328 INFO L226 Difference]: Without dead ends: 653 [2019-11-15 22:20:07,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-15 22:20:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-11-15 22:20:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-11-15 22:20:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 901 transitions. [2019-11-15 22:20:07,350 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 901 transitions. Word has length 105 [2019-11-15 22:20:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:07,350 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 901 transitions. [2019-11-15 22:20:07,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 901 transitions. [2019-11-15 22:20:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 22:20:07,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:07,354 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:07,354 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 51406530, now seen corresponding path program 1 times [2019-11-15 22:20:07,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:07,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480463547] [2019-11-15 22:20:07,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:07,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:07,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:07,372 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:20:07,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360291680] [2019-11-15 22:20:07,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:07,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:20:07,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:20:07,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480463547] [2019-11-15 22:20:07,563 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:20:07,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360291680] [2019-11-15 22:20:07,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:07,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:20:07,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294964103] [2019-11-15 22:20:07,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:07,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:20:07,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:07,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:07,567 INFO L87 Difference]: Start difference. First operand 653 states and 901 transitions. Second operand 3 states. [2019-11-15 22:20:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:07,752 INFO L93 Difference]: Finished difference Result 1377 states and 1926 transitions. [2019-11-15 22:20:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:07,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-15 22:20:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:07,758 INFO L225 Difference]: With dead ends: 1377 [2019-11-15 22:20:07,759 INFO L226 Difference]: Without dead ends: 733 [2019-11-15 22:20:07,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-11-15 22:20:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 722. [2019-11-15 22:20:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-11-15 22:20:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 985 transitions. [2019-11-15 22:20:07,783 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 985 transitions. Word has length 130 [2019-11-15 22:20:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:07,783 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 985 transitions. [2019-11-15 22:20:07,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 985 transitions. [2019-11-15 22:20:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:20:07,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:07,787 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:07,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:07,993 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash -837503083, now seen corresponding path program 1 times [2019-11-15 22:20:07,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:20:07,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278209903] [2019-11-15 22:20:07,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:07,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:20:07,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:20:08,030 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:20:08,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895090275] [2019-11-15 22:20:08,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:20:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:20:08,438 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:20:08,439 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:20:08,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:20:08,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:20:08 BoogieIcfgContainer [2019-11-15 22:20:08,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:20:08,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:20:08,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:20:08,773 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:20:08,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:20:04" (3/4) ... [2019-11-15 22:20:08,778 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:20:08,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:20:08,781 INFO L168 Benchmark]: Toolchain (without parser) took 5621.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 951.4 MB in the beginning and 913.3 MB in the end (delta: 38.1 MB). Peak memory consumption was 189.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:08,781 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:08,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:08,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:08,783 INFO L168 Benchmark]: Boogie Preprocessor took 44.25 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:08,789 INFO L168 Benchmark]: RCFGBuilder took 912.17 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:08,790 INFO L168 Benchmark]: TraceAbstraction took 3999.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.3 MB in the end (delta: 171.2 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:08,790 INFO L168 Benchmark]: Witness Printer took 5.49 ms. Allocated memory is still 1.2 GB. Free memory is still 913.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:08,798 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.17 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 581.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.30 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 44.25 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 912.17 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3999.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.3 MB in the end (delta: 171.2 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.49 ms. Allocated memory is still 1.2 GB. Free memory is still 913.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 620]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 363, overapproximation of bitwiseAnd at line 219. Possible FailurePath: [L629] 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] int s__version = __VERIFIER_nondet_int(); [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] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L28] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [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] int tmp___1 ; [L52] int tmp___2 ; [L53] int tmp___3 ; [L54] int tmp___4 ; [L55] int tmp___5 ; [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 ag_Z ; [L64] unsigned int ag_V ; [L65] unsigned int ag_W ; [L66] int __retres62 ; [L69] ag_V = 2U [L70] ag_W = 5U [L71] s__state = 12292 [L72] blastFlag = 0 [L73] tmp = __VERIFIER_nondet_int() [L74] cb = 0 [L75] ret = -1 [L76] skip = 0 [L77] tmp___0 = 0 [L78] COND TRUE s__info_callback != 0 [L79] cb = s__info_callback [L87] s__in_handshake = s__in_handshake + 1 [L88] tmp___1 = __VERIFIER_nondet_int() [L89] COND FALSE !(tmp___1 & 12288) [L100] COND TRUE 1 [L102] state = s__state [L103] COND TRUE s__state == 12292 [L206] s__new_session = 1 [L207] s__state = 4096 [L208] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L213] s__server = 0 [L214] COND TRUE cb != 0 [L219] COND FALSE !((s__version & 65280) != 768) [L225] s__type = 4096 [L226] COND FALSE !(s__init_buf___0 == 0) [L245] tmp___4 = __VERIFIER_nondet_int() [L246] COND FALSE !(! tmp___4) [L252] tmp___5 = __VERIFIER_nondet_int() [L253] COND FALSE !(! tmp___5) [L259] s__state = 4368 [L260] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L261] s__init_num = 0 [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND TRUE s__state == 4368 [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND TRUE blastFlag == 0 [L268] blastFlag = 1 [L272] COND FALSE !(ret <= 0) [L277] s__state = 4384 [L278] s__init_num = 0 [L279] COND TRUE s__bbio != s__wbio [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND TRUE s__state == 4384 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L298] COND FALSE !(\read(s__hit)) [L301] s__state = 4400 [L303] s__init_num = 0 [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND TRUE s__state == 4400 [L307] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L310] ret = __VERIFIER_nondet_int() [L311] COND TRUE blastFlag == 2 [L312] blastFlag = 3 [L316] COND FALSE !(ret <= 0) [L322] s__state = 4416 [L323] s__init_num = 0 [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND TRUE s__state == 4416 [L327] ret = __VERIFIER_nondet_int() [L328] COND TRUE blastFlag == 3 [L329] blastFlag = 4 [L333] COND FALSE !(ret <= 0) [L338] s__state = 4432 [L339] s__init_num = 0 [L340] COND FALSE !(! tmp___6) [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND TRUE s__state == 4432 [L349] ret = __VERIFIER_nondet_int() [L350] COND FALSE !(blastFlag == 5) [L355] COND FALSE !(ret <= 0) [L360] s__state = 4448 [L361] ag_X = 44 [L362] ag_Y = 100 [L363] ag_Z = ag_V << ag_W [L364] s__init_num = 0 [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND FALSE !(s__state == 4432) [L145] COND FALSE !(s__state == 4433) [L148] COND TRUE s__state == 4448 [L368] ret = __VERIFIER_nondet_int() [L369] COND TRUE blastFlag == 4 [L370] blastFlag = 5 [L374] COND FALSE !(ret <= 0) [L379] COND TRUE \read(s__s3__tmp__cert_req) [L380] s__state = ag_X * ag_Y + ag_Z [L384] s__init_num = 0 [L578] COND FALSE !(! s__s3__tmp__reuse_message) [L607] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND TRUE s__state == 4432 [L349] ret = __VERIFIER_nondet_int() [L350] COND TRUE blastFlag == 5 [L620] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1540 SDtfs, 402 SDslu, 859 SDs, 0 SdLazy, 738 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 83783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 659/659 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-11-15 22:20:11,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:20:11,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:20:11,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:20:11,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:20:11,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:20:11,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:20:11,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:20:11,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:20:11,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:20:11,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:20:11,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:20:11,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:20:11,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:20:11,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:20:11,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:20:11,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:20:11,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:20:11,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:20:11,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:20:11,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:20:11,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:20:11,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:20:11,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:20:11,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:20:11,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:20:11,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:20:11,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:20:11,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:20:11,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:20:11,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:20:11,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:20:11,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:20:11,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:20:11,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:20:11,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:20:11,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:20:11,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:20:11,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:20:11,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:20:11,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:20:11,594 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:20:11,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:20:11,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:20:11,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:20:11,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:20:11,619 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:20:11,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:20:11,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:20:11,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:20:11,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:20:11,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:20:11,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:20:11,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:20:11,622 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:20:11,622 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:20:11,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:20:11,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:20:11,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:20:11,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:20:11,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:20:11,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:20:11,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:20:11,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:20:11,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:20:11,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:20:11,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:20:11,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:20:11,627 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:20:11,627 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:20:11,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:20:11,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:20:11,628 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/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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 -> 008a1a21da249b9d9d0b9660845bc4112d6c99e8 [2019-11-15 22:20:11,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:20:11,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:20:11,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:20:11,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:20:11,693 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:20:11,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-1a.c [2019-11-15 22:20:11,752 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/16ea7e27c/029911a387274dc2a048d0556083665a/FLAG996b9f0f6 [2019-11-15 22:20:12,269 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:20:12,270 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-1a.c [2019-11-15 22:20:12,286 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/16ea7e27c/029911a387274dc2a048d0556083665a/FLAG996b9f0f6 [2019-11-15 22:20:12,624 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/data/16ea7e27c/029911a387274dc2a048d0556083665a [2019-11-15 22:20:12,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:20:12,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:20:12,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:20:12,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:20:12,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:20:12,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:20:12" (1/1) ... [2019-11-15 22:20:12,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c1d6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:12, skipping insertion in model container [2019-11-15 22:20:12,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:20:12" (1/1) ... [2019-11-15 22:20:12,648 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:20:12,709 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:20:13,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:20:13,066 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:20:13,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:20:13,251 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:20:13,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13 WrapperNode [2019-11-15 22:20:13,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:20:13,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:20:13,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:20:13,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:20:13,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:20:13,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:20:13,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:20:13,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:20:13,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... [2019-11-15 22:20:13,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:20:13,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:20:13,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:20:13,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:20:13,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:20:13,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:20:13,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:20:13,607 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:20:14,224 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 22:20:14,224 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 22:20:14,226 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:20:14,226 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:20:14,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:20:14 BoogieIcfgContainer [2019-11-15 22:20:14,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:20:14,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:20:14,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:20:14,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:20:14,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:20:12" (1/3) ... [2019-11-15 22:20:14,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f148864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:20:14, skipping insertion in model container [2019-11-15 22:20:14,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:20:13" (2/3) ... [2019-11-15 22:20:14,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f148864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:20:14, skipping insertion in model container [2019-11-15 22:20:14,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:20:14" (3/3) ... [2019-11-15 22:20:14,239 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.BV.c.cil-1a.c [2019-11-15 22:20:14,251 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:20:14,260 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:20:14,269 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:20:14,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:20:14,296 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:20:14,296 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:20:14,296 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:20:14,296 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:20:14,297 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:20:14,297 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:20:14,297 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:20:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-15 22:20:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:20:14,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:14,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:14,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582915, now seen corresponding path program 1 times [2019-11-15 22:20:14,349 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:14,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [987155182] [2019-11-15 22:20:14,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:14,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:14,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:14,579 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:14,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [987155182] [2019-11-15 22:20:14,604 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:14,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 22:20:14,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634485290] [2019-11-15 22:20:14,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:14,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:14,632 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-15 22:20:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:14,920 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-11-15 22:20:14,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:14,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 22:20:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:14,942 INFO L225 Difference]: With dead ends: 247 [2019-11-15 22:20:14,942 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 22:20:14,948 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-11-15 22:20:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 22:20:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-15 22:20:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 22:20:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-11-15 22:20:15,023 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 23 [2019-11-15 22:20:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:15,023 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-11-15 22:20:15,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-11-15 22:20:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:20:15,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:15,028 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:15,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:15,231 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1463943324, now seen corresponding path program 1 times [2019-11-15 22:20:15,233 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:15,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1516332559] [2019-11-15 22:20:15,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:15,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:15,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:15,334 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:15,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1516332559] [2019-11-15 22:20:15,342 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:15,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:15,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279658118] [2019-11-15 22:20:15,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:15,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:15,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:15,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:15,345 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-11-15 22:20:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:15,593 INFO L93 Difference]: Finished difference Result 233 states and 355 transitions. [2019-11-15 22:20:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:15,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 22:20:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:15,596 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:20:15,596 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 22:20:15,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 22:20:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-15 22:20:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 22:20:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-11-15 22:20:15,611 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-11-15 22:20:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:15,612 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-11-15 22:20:15,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-11-15 22:20:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:20:15,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:15,615 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:15,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:15,818 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1876827341, now seen corresponding path program 1 times [2019-11-15 22:20:15,820 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:15,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1447102610] [2019-11-15 22:20:15,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:15,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:15,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:20:15,945 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:20:15,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1447102610] [2019-11-15 22:20:15,952 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:15,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:15,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333896856] [2019-11-15 22:20:15,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:15,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:15,954 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-11-15 22:20:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:16,154 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2019-11-15 22:20:16,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:16,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 22:20:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:16,157 INFO L225 Difference]: With dead ends: 266 [2019-11-15 22:20:16,157 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 22:20:16,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 22:20:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-15 22:20:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 22:20:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-11-15 22:20:16,169 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-11-15 22:20:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:16,169 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-11-15 22:20:16,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-11-15 22:20:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:20:16,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:16,173 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:16,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:16,375 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash -708368503, now seen corresponding path program 1 times [2019-11-15 22:20:16,376 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:16,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [290581266] [2019-11-15 22:20:16,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:16,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:16,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:20:16,507 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:20:16,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [290581266] [2019-11-15 22:20:16,523 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:16,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:16,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998850466] [2019-11-15 22:20:16,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:16,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:16,530 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 4 states. [2019-11-15 22:20:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:16,624 INFO L93 Difference]: Finished difference Result 543 states and 801 transitions. [2019-11-15 22:20:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:16,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:20:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:16,629 INFO L225 Difference]: With dead ends: 543 [2019-11-15 22:20:16,629 INFO L226 Difference]: Without dead ends: 408 [2019-11-15 22:20:16,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 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-11-15 22:20:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-15 22:20:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-15 22:20:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-15 22:20:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 596 transitions. [2019-11-15 22:20:16,688 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 596 transitions. Word has length 67 [2019-11-15 22:20:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 596 transitions. [2019-11-15 22:20:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 596 transitions. [2019-11-15 22:20:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:20:16,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:16,696 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:16,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:16,899 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash -995531590, now seen corresponding path program 1 times [2019-11-15 22:20:16,900 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:16,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [452662463] [2019-11-15 22:20:16,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:17,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:17,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 22:20:17,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 22:20:17,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452662463] [2019-11-15 22:20:17,058 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:17,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:17,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485674682] [2019-11-15 22:20:17,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:17,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:17,060 INFO L87 Difference]: Start difference. First operand 408 states and 596 transitions. Second operand 3 states. [2019-11-15 22:20:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:17,105 INFO L93 Difference]: Finished difference Result 828 states and 1207 transitions. [2019-11-15 22:20:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:17,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 22:20:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:17,109 INFO L225 Difference]: With dead ends: 828 [2019-11-15 22:20:17,110 INFO L226 Difference]: Without dead ends: 429 [2019-11-15 22:20:17,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-15 22:20:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-15 22:20:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-15 22:20:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 623 transitions. [2019-11-15 22:20:17,130 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 623 transitions. Word has length 92 [2019-11-15 22:20:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:17,130 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 623 transitions. [2019-11-15 22:20:17,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 623 transitions. [2019-11-15 22:20:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:20:17,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:17,136 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:17,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:17,346 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1727499016, now seen corresponding path program 1 times [2019-11-15 22:20:17,347 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:17,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1288836879] [2019-11-15 22:20:17,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:17,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:17,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 22:20:17,498 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 22:20:17,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1288836879] [2019-11-15 22:20:17,510 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:17,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 22:20:17,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227149778] [2019-11-15 22:20:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:17,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:17,512 INFO L87 Difference]: Start difference. First operand 429 states and 623 transitions. Second operand 3 states. [2019-11-15 22:20:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:17,550 INFO L93 Difference]: Finished difference Result 876 states and 1268 transitions. [2019-11-15 22:20:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:17,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 22:20:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:17,552 INFO L225 Difference]: With dead ends: 876 [2019-11-15 22:20:17,553 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 22:20:17,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 22:20:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-11-15 22:20:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-15 22:20:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 657 transitions. [2019-11-15 22:20:17,570 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 657 transitions. Word has length 92 [2019-11-15 22:20:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:17,571 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 657 transitions. [2019-11-15 22:20:17,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 657 transitions. [2019-11-15 22:20:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 22:20:17,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:17,573 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:17,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:17,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash 198697340, now seen corresponding path program 1 times [2019-11-15 22:20:17,777 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:17,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [392933549] [2019-11-15 22:20:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:17,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 22:20:17,894 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 22:20:17,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392933549] [2019-11-15 22:20:17,909 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:17,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:17,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459636702] [2019-11-15 22:20:17,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:17,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:17,911 INFO L87 Difference]: Start difference. First operand 456 states and 657 transitions. Second operand 3 states. [2019-11-15 22:20:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:18,151 INFO L93 Difference]: Finished difference Result 948 states and 1392 transitions. [2019-11-15 22:20:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:18,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-15 22:20:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:18,156 INFO L225 Difference]: With dead ends: 948 [2019-11-15 22:20:18,157 INFO L226 Difference]: Without dead ends: 528 [2019-11-15 22:20:18,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-15 22:20:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2019-11-15 22:20:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-11-15 22:20:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 735 transitions. [2019-11-15 22:20:18,177 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 735 transitions. Word has length 110 [2019-11-15 22:20:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:18,178 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 735 transitions. [2019-11-15 22:20:18,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 735 transitions. [2019-11-15 22:20:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 22:20:18,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:18,181 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:18,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:18,384 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2009981316, now seen corresponding path program 1 times [2019-11-15 22:20:18,385 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:18,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1482073061] [2019-11-15 22:20:18,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:18,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:18,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:20:18,518 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:20:18,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482073061] [2019-11-15 22:20:18,535 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:18,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:18,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928240352] [2019-11-15 22:20:18,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:18,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:18,537 INFO L87 Difference]: Start difference. First operand 519 states and 735 transitions. Second operand 3 states. [2019-11-15 22:20:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:18,750 INFO L93 Difference]: Finished difference Result 1081 states and 1559 transitions. [2019-11-15 22:20:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:18,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-15 22:20:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:18,755 INFO L225 Difference]: With dead ends: 1081 [2019-11-15 22:20:18,755 INFO L226 Difference]: Without dead ends: 598 [2019-11-15 22:20:18,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-15 22:20:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 588. [2019-11-15 22:20:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-11-15 22:20:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 819 transitions. [2019-11-15 22:20:18,777 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 819 transitions. Word has length 130 [2019-11-15 22:20:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:18,777 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 819 transitions. [2019-11-15 22:20:18,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 819 transitions. [2019-11-15 22:20:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:20:18,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:18,780 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:18,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:18,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1304357395, now seen corresponding path program 1 times [2019-11-15 22:20:18,983 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:18,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1178898112] [2019-11-15 22:20:18,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:19,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:19,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-15 22:20:19,136 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-15 22:20:19,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1178898112] [2019-11-15 22:20:19,163 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:19,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:19,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043446567] [2019-11-15 22:20:19,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:19,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:19,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:19,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:19,165 INFO L87 Difference]: Start difference. First operand 588 states and 819 transitions. Second operand 4 states. [2019-11-15 22:20:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:19,540 INFO L93 Difference]: Finished difference Result 1340 states and 1949 transitions. [2019-11-15 22:20:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:19,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 22:20:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:19,552 INFO L225 Difference]: With dead ends: 1340 [2019-11-15 22:20:19,552 INFO L226 Difference]: Without dead ends: 788 [2019-11-15 22:20:19,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 298 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-11-15 22:20:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-11-15 22:20:19,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 768. [2019-11-15 22:20:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-15 22:20:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1056 transitions. [2019-11-15 22:20:19,584 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1056 transitions. Word has length 151 [2019-11-15 22:20:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:19,585 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1056 transitions. [2019-11-15 22:20:19,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1056 transitions. [2019-11-15 22:20:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:20:19,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:19,591 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:19,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:19,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -837503083, now seen corresponding path program 1 times [2019-11-15 22:20:19,795 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:19,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [855040491] [2019-11-15 22:20:19,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:20,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:20:20,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 164 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:20:20,219 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 164 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:20:20,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [855040491] [2019-11-15 22:20:20,554 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:20:20,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-15 22:20:20,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577709400] [2019-11-15 22:20:20,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:20:20,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:20:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:20:20,556 INFO L87 Difference]: Start difference. First operand 768 states and 1056 transitions. Second operand 8 states. [2019-11-15 22:20:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:22,622 INFO L93 Difference]: Finished difference Result 2004 states and 2818 transitions. [2019-11-15 22:20:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:20:22,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-11-15 22:20:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:22,631 INFO L225 Difference]: With dead ends: 2004 [2019-11-15 22:20:22,632 INFO L226 Difference]: Without dead ends: 1272 [2019-11-15 22:20:22,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:20:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-11-15 22:20:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1144. [2019-11-15 22:20:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-11-15 22:20:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1601 transitions. [2019-11-15 22:20:22,689 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1601 transitions. Word has length 151 [2019-11-15 22:20:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:22,689 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 1601 transitions. [2019-11-15 22:20:22,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:20:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1601 transitions. [2019-11-15 22:20:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 22:20:22,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:22,693 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:22,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:22,901 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash -331312483, now seen corresponding path program 1 times [2019-11-15 22:20:22,902 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:22,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1697804184] [2019-11-15 22:20:22,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:23,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:23,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 22:20:23,063 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 22:20:23,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697804184] [2019-11-15 22:20:23,086 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:23,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:23,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484843099] [2019-11-15 22:20:23,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:23,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:23,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:23,088 INFO L87 Difference]: Start difference. First operand 1144 states and 1601 transitions. Second operand 4 states. [2019-11-15 22:20:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:23,420 INFO L93 Difference]: Finished difference Result 2381 states and 3386 transitions. [2019-11-15 22:20:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:23,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 22:20:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:23,429 INFO L225 Difference]: With dead ends: 2381 [2019-11-15 22:20:23,429 INFO L226 Difference]: Without dead ends: 1294 [2019-11-15 22:20:23,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 300 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-11-15 22:20:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-11-15 22:20:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1272. [2019-11-15 22:20:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-11-15 22:20:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1749 transitions. [2019-11-15 22:20:23,475 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1749 transitions. Word has length 152 [2019-11-15 22:20:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:23,475 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 1749 transitions. [2019-11-15 22:20:23,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1749 transitions. [2019-11-15 22:20:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:20:23,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:23,480 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:23,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:23,682 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1326654517, now seen corresponding path program 1 times [2019-11-15 22:20:23,683 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:23,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [160725449] [2019-11-15 22:20:23,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:23,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:23,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-11-15 22:20:23,867 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-11-15 22:20:23,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [160725449] [2019-11-15 22:20:23,943 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:23,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:23,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127245509] [2019-11-15 22:20:23,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:23,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:23,944 INFO L87 Difference]: Start difference. First operand 1272 states and 1749 transitions. Second operand 4 states. [2019-11-15 22:20:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:24,111 INFO L93 Difference]: Finished difference Result 4824 states and 6666 transitions. [2019-11-15 22:20:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:24,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:20:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:24,134 INFO L225 Difference]: With dead ends: 4824 [2019-11-15 22:20:24,134 INFO L226 Difference]: Without dead ends: 3609 [2019-11-15 22:20:24,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 398 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-11-15 22:20:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2019-11-15 22:20:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3369. [2019-11-15 22:20:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2019-11-15 22:20:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4644 transitions. [2019-11-15 22:20:24,286 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4644 transitions. Word has length 201 [2019-11-15 22:20:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:24,287 INFO L462 AbstractCegarLoop]: Abstraction has 3369 states and 4644 transitions. [2019-11-15 22:20:24,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4644 transitions. [2019-11-15 22:20:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:20:24,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:24,299 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:24,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:24,501 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2070919501, now seen corresponding path program 1 times [2019-11-15 22:20:24,502 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:24,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1039762168] [2019-11-15 22:20:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:24,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:24,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 22:20:24,699 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 22:20:24,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1039762168] [2019-11-15 22:20:24,738 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:24,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:24,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932461947] [2019-11-15 22:20:24,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:24,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:24,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:24,741 INFO L87 Difference]: Start difference. First operand 3369 states and 4644 transitions. Second operand 4 states. [2019-11-15 22:20:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:25,155 INFO L93 Difference]: Finished difference Result 7126 states and 9973 transitions. [2019-11-15 22:20:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:25,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:20:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:25,179 INFO L225 Difference]: With dead ends: 7126 [2019-11-15 22:20:25,180 INFO L226 Difference]: Without dead ends: 3814 [2019-11-15 22:20:25,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 398 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-11-15 22:20:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2019-11-15 22:20:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3765. [2019-11-15 22:20:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-15 22:20:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5084 transitions. [2019-11-15 22:20:25,320 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5084 transitions. Word has length 201 [2019-11-15 22:20:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:25,321 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5084 transitions. [2019-11-15 22:20:25,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5084 transitions. [2019-11-15 22:20:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 22:20:25,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:25,332 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:25,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:25,536 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1541830923, now seen corresponding path program 1 times [2019-11-15 22:20:25,537 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:25,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [750831814] [2019-11-15 22:20:25,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:25,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:25,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-15 22:20:25,728 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-15 22:20:25,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [750831814] [2019-11-15 22:20:25,815 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:25,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:25,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766892715] [2019-11-15 22:20:25,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:25,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:25,817 INFO L87 Difference]: Start difference. First operand 3765 states and 5084 transitions. Second operand 4 states. [2019-11-15 22:20:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:26,194 INFO L93 Difference]: Finished difference Result 7654 states and 10381 transitions. [2019-11-15 22:20:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:26,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-11-15 22:20:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:26,218 INFO L225 Difference]: With dead ends: 7654 [2019-11-15 22:20:26,218 INFO L226 Difference]: Without dead ends: 3946 [2019-11-15 22:20:26,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 448 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-11-15 22:20:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-11-15 22:20:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3897. [2019-11-15 22:20:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2019-11-15 22:20:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 5225 transitions. [2019-11-15 22:20:26,372 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 5225 transitions. Word has length 226 [2019-11-15 22:20:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:26,373 INFO L462 AbstractCegarLoop]: Abstraction has 3897 states and 5225 transitions. [2019-11-15 22:20:26,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 5225 transitions. [2019-11-15 22:20:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-15 22:20:26,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:26,385 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:26,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:26,597 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash 404075109, now seen corresponding path program 1 times [2019-11-15 22:20:26,598 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:26,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [366209088] [2019-11-15 22:20:26,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:26,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:26,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-11-15 22:20:26,824 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-11-15 22:20:26,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366209088] [2019-11-15 22:20:26,913 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:26,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:26,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460696333] [2019-11-15 22:20:26,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:26,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:26,914 INFO L87 Difference]: Start difference. First operand 3897 states and 5225 transitions. Second operand 3 states. [2019-11-15 22:20:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:27,028 INFO L93 Difference]: Finished difference Result 8156 states and 10923 transitions. [2019-11-15 22:20:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:27,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-11-15 22:20:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:27,056 INFO L225 Difference]: With dead ends: 8156 [2019-11-15 22:20:27,056 INFO L226 Difference]: Without dead ends: 4893 [2019-11-15 22:20:27,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2019-11-15 22:20:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4893. [2019-11-15 22:20:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4893 states. [2019-11-15 22:20:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 6548 transitions. [2019-11-15 22:20:27,286 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 6548 transitions. Word has length 253 [2019-11-15 22:20:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:27,286 INFO L462 AbstractCegarLoop]: Abstraction has 4893 states and 6548 transitions. [2019-11-15 22:20:27,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 6548 transitions. [2019-11-15 22:20:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 22:20:27,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:27,303 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:27,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:27,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1718543591, now seen corresponding path program 1 times [2019-11-15 22:20:27,507 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:27,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1024569846] [2019-11-15 22:20:27,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:27,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:27,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-15 22:20:27,714 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-15 22:20:27,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024569846] [2019-11-15 22:20:27,764 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:27,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:27,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39584463] [2019-11-15 22:20:27,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:27,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:27,768 INFO L87 Difference]: Start difference. First operand 4893 states and 6548 transitions. Second operand 3 states. [2019-11-15 22:20:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:28,122 INFO L93 Difference]: Finished difference Result 10275 states and 13960 transitions. [2019-11-15 22:20:28,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:28,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-11-15 22:20:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:28,154 INFO L225 Difference]: With dead ends: 10275 [2019-11-15 22:20:28,155 INFO L226 Difference]: Without dead ends: 5439 [2019-11-15 22:20:28,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2019-11-15 22:20:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5411. [2019-11-15 22:20:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5411 states. [2019-11-15 22:20:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5411 states to 5411 states and 7136 transitions. [2019-11-15 22:20:28,312 INFO L78 Accepts]: Start accepts. Automaton has 5411 states and 7136 transitions. Word has length 254 [2019-11-15 22:20:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:28,313 INFO L462 AbstractCegarLoop]: Abstraction has 5411 states and 7136 transitions. [2019-11-15 22:20:28,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5411 states and 7136 transitions. [2019-11-15 22:20:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-15 22:20:28,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:28,329 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:28,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:28,540 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash 734575864, now seen corresponding path program 1 times [2019-11-15 22:20:28,541 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:28,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [72186076] [2019-11-15 22:20:28,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:28,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:20:28,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-15 22:20:28,759 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-15 22:20:28,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [72186076] [2019-11-15 22:20:28,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:20:28,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-15 22:20:28,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169743886] [2019-11-15 22:20:28,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:20:28,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:28,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:20:28,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:20:28,891 INFO L87 Difference]: Start difference. First operand 5411 states and 7136 transitions. Second operand 6 states. [2019-11-15 22:20:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:29,939 INFO L93 Difference]: Finished difference Result 19118 states and 25205 transitions. [2019-11-15 22:20:29,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:20:29,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 290 [2019-11-15 22:20:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:29,971 INFO L225 Difference]: With dead ends: 19118 [2019-11-15 22:20:29,971 INFO L226 Difference]: Without dead ends: 13764 [2019-11-15 22:20:29,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:20:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13764 states. [2019-11-15 22:20:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13764 to 9190. [2019-11-15 22:20:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9190 states. [2019-11-15 22:20:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9190 states to 9190 states and 12442 transitions. [2019-11-15 22:20:30,217 INFO L78 Accepts]: Start accepts. Automaton has 9190 states and 12442 transitions. Word has length 290 [2019-11-15 22:20:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:30,218 INFO L462 AbstractCegarLoop]: Abstraction has 9190 states and 12442 transitions. [2019-11-15 22:20:30,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:20:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9190 states and 12442 transitions. [2019-11-15 22:20:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 22:20:30,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:30,240 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:30,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:30,443 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2072088036, now seen corresponding path program 1 times [2019-11-15 22:20:30,444 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:30,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1007136252] [2019-11-15 22:20:30,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:30,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:30,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-15 22:20:30,643 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-15 22:20:30,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1007136252] [2019-11-15 22:20:30,742 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:30,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:30,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15486770] [2019-11-15 22:20:30,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:30,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:30,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:30,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:30,745 INFO L87 Difference]: Start difference. First operand 9190 states and 12442 transitions. Second operand 4 states. [2019-11-15 22:20:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:31,236 INFO L93 Difference]: Finished difference Result 19632 states and 26982 transitions. [2019-11-15 22:20:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:31,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-15 22:20:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:31,256 INFO L225 Difference]: With dead ends: 19632 [2019-11-15 22:20:31,257 INFO L226 Difference]: Without dead ends: 10686 [2019-11-15 22:20:31,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 578 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-11-15 22:20:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10686 states. [2019-11-15 22:20:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10686 to 10324. [2019-11-15 22:20:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10324 states. [2019-11-15 22:20:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10324 states to 10324 states and 13684 transitions. [2019-11-15 22:20:31,543 INFO L78 Accepts]: Start accepts. Automaton has 10324 states and 13684 transitions. Word has length 291 [2019-11-15 22:20:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:31,544 INFO L462 AbstractCegarLoop]: Abstraction has 10324 states and 13684 transitions. [2019-11-15 22:20:31,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10324 states and 13684 transitions. [2019-11-15 22:20:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 22:20:31,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:31,563 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:31,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:31,769 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash 739838947, now seen corresponding path program 1 times [2019-11-15 22:20:31,770 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:31,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1889496763] [2019-11-15 22:20:31,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:31,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:31,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2019-11-15 22:20:31,996 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2019-11-15 22:20:32,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1889496763] [2019-11-15 22:20:32,072 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:32,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:20:32,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190420132] [2019-11-15 22:20:32,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:20:32,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:20:32,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:32,074 INFO L87 Difference]: Start difference. First operand 10324 states and 13684 transitions. Second operand 3 states. [2019-11-15 22:20:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:32,375 INFO L93 Difference]: Finished difference Result 24966 states and 33080 transitions. [2019-11-15 22:20:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:20:32,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-15 22:20:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:32,393 INFO L225 Difference]: With dead ends: 24966 [2019-11-15 22:20:32,393 INFO L226 Difference]: Without dead ends: 14699 [2019-11-15 22:20:32,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:20:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14699 states. [2019-11-15 22:20:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14699 to 14697. [2019-11-15 22:20:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14697 states. [2019-11-15 22:20:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14697 states to 14697 states and 19391 transitions. [2019-11-15 22:20:32,799 INFO L78 Accepts]: Start accepts. Automaton has 14697 states and 19391 transitions. Word has length 292 [2019-11-15 22:20:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:32,800 INFO L462 AbstractCegarLoop]: Abstraction has 14697 states and 19391 transitions. [2019-11-15 22:20:32,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:20:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14697 states and 19391 transitions. [2019-11-15 22:20:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-11-15 22:20:32,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:32,823 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:33,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:33,027 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:33,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1425253194, now seen corresponding path program 1 times [2019-11-15 22:20:33,028 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:33,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1574540396] [2019-11-15 22:20:33,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:33,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:20:33,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-11-15 22:20:33,360 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-11-15 22:20:33,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1574540396] [2019-11-15 22:20:33,471 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:20:33,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:20:33,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819903650] [2019-11-15 22:20:33,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:20:33,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:20:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:20:33,474 INFO L87 Difference]: Start difference. First operand 14697 states and 19391 transitions. Second operand 4 states. [2019-11-15 22:20:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:34,307 INFO L93 Difference]: Finished difference Result 28919 states and 38544 transitions. [2019-11-15 22:20:34,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:20:34,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2019-11-15 22:20:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:34,317 INFO L225 Difference]: With dead ends: 28919 [2019-11-15 22:20:34,317 INFO L226 Difference]: Without dead ends: 6235 [2019-11-15 22:20:34,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 762 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-11-15 22:20:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2019-11-15 22:20:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 5776. [2019-11-15 22:20:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5776 states. [2019-11-15 22:20:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 7296 transitions. [2019-11-15 22:20:34,492 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 7296 transitions. Word has length 383 [2019-11-15 22:20:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:34,493 INFO L462 AbstractCegarLoop]: Abstraction has 5776 states and 7296 transitions. [2019-11-15 22:20:34,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:20:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 7296 transitions. [2019-11-15 22:20:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-11-15 22:20:34,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:20:34,503 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:20:34,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:34,705 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:20:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:20:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash -429036479, now seen corresponding path program 1 times [2019-11-15 22:20:34,707 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:20:34,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1533482744] [2019-11-15 22:20:34,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/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-11-15 22:20:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:20:34,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:20:34,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:20:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1286 proven. 14 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2019-11-15 22:20:35,108 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1286 proven. 14 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2019-11-15 22:20:35,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1533482744] [2019-11-15 22:20:35,283 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:20:35,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-15 22:20:35,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790267976] [2019-11-15 22:20:35,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:20:35,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:20:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:20:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:20:35,286 INFO L87 Difference]: Start difference. First operand 5776 states and 7296 transitions. Second operand 6 states. [2019-11-15 22:20:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:20:35,652 INFO L93 Difference]: Finished difference Result 5989 states and 7566 transitions. [2019-11-15 22:20:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:20:35,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 440 [2019-11-15 22:20:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:20:35,657 INFO L225 Difference]: With dead ends: 5989 [2019-11-15 22:20:35,657 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:20:35,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 876 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-11-15 22:20:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:20:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:20:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:20:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:20:35,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 440 [2019-11-15 22:20:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:20:35,662 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:20:35,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:20:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:20:35,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:20:35,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:20:35,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:20:36,029 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-11-15 22:20:36,248 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 148 [2019-11-15 22:20:36,464 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 114 [2019-11-15 22:20:36,662 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 142 [2019-11-15 22:20:37,639 WARN L191 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 634 DAG size of output: 132 [2019-11-15 22:20:38,343 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-11-15 22:20:38,725 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-11-15 22:20:39,531 WARN L191 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 52 [2019-11-15 22:20:39,721 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-11-15 22:20:39,932 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-11-15 22:20:40,194 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2019-11-15 22:20:40,363 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 37 [2019-11-15 22:20:40,525 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-11-15 22:20:40,854 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 53 [2019-11-15 22:20:41,815 WARN L191 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-11-15 22:20:41,993 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-15 22:20:42,548 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2019-11-15 22:20:42,730 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-11-15 22:20:43,200 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-11-15 22:20:43,480 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-15 22:20:43,878 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 53 [2019-11-15 22:20:43,880 INFO L443 ceAbstractionStarter]: For program point L267(lines 267 271) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L267-2(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 536) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 620) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 240) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 555) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 566) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 577) no Hoare annotation was computed. [2019-11-15 22:20:43,881 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 505) no Hoare annotation was computed. [2019-11-15 22:20:43,882 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 478) no Hoare annotation was computed. [2019-11-15 22:20:43,882 INFO L443 ceAbstractionStarter]: For program point L467-1(lines 467 478) no Hoare annotation was computed. [2019-11-15 22:20:43,882 INFO L446 ceAbstractionStarter]: At program point L203(lines 202 544) the Hoare annotation is: true [2019-11-15 22:20:43,883 INFO L439 ceAbstractionStarter]: At program point L170(lines 166 556) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse8 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) (and (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse5 .cse6 .cse7 .cse8 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) .cse9)) (and .cse0 .cse1 (and (and .cse3 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8) .cse4 .cse9) .cse2))) [2019-11-15 22:20:43,883 INFO L439 ceAbstractionStarter]: At program point L104(lines 103 577) the Hoare annotation is: (let ((.cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse2 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0))) (or (and .cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse3 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse1 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse2 .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) (and .cse0 .cse3 .cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse2))) [2019-11-15 22:20:43,883 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 406) no Hoare annotation was computed. [2019-11-15 22:20:43,883 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-11-15 22:20:43,883 INFO L443 ceAbstractionStarter]: For program point L369-2(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,883 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 475) no Hoare annotation was computed. [2019-11-15 22:20:43,883 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 554) no Hoare annotation was computed. [2019-11-15 22:20:43,884 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 565) no Hoare annotation was computed. [2019-11-15 22:20:43,884 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 576) no Hoare annotation was computed. [2019-11-15 22:20:43,884 INFO L439 ceAbstractionStarter]: At program point L140(lines 136 566) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse5 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse7 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7))) [2019-11-15 22:20:43,884 INFO L446 ceAbstractionStarter]: At program point L636(lines 628 638) the Hoare annotation is: true [2019-11-15 22:20:43,884 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-15 22:20:43,884 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,884 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 345) no Hoare annotation was computed. [2019-11-15 22:20:43,885 INFO L443 ceAbstractionStarter]: For program point L307-1(lines 307 321) no Hoare annotation was computed. [2019-11-15 22:20:43,885 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 553) no Hoare annotation was computed. [2019-11-15 22:20:43,885 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 564) no Hoare annotation was computed. [2019-11-15 22:20:43,885 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 575) no Hoare annotation was computed. [2019-11-15 22:20:43,885 INFO L439 ceAbstractionStarter]: At program point L209(lines 106 576) the Hoare annotation is: (let ((.cse7 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse6 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse9 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) (and .cse7 .cse1 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse9))) [2019-11-15 22:20:43,885 INFO L439 ceAbstractionStarter]: At program point L176(lines 172 554) the Hoare annotation is: (let ((.cse7 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse2 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse5 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and (and (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) (and .cse0 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0))) .cse7 .cse8 .cse9) (and .cse7 .cse8 (and .cse0 .cse1 .cse2 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse3 .cse4 .cse5 .cse6) .cse9))) [2019-11-15 22:20:43,886 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 413) no Hoare annotation was computed. [2019-11-15 22:20:43,886 INFO L443 ceAbstractionStarter]: For program point L408-2(lines 408 413) no Hoare annotation was computed. [2019-11-15 22:20:43,886 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-11-15 22:20:43,886 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 552) no Hoare annotation was computed. [2019-11-15 22:20:43,886 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 563) no Hoare annotation was computed. [2019-11-15 22:20:43,886 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 574) no Hoare annotation was computed. [2019-11-15 22:20:43,887 INFO L439 ceAbstractionStarter]: At program point L542(lines 100 608) the Hoare annotation is: (let ((.cse7 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse12 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse14 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse15 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse11 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse2 (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse4 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse6 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6) (and .cse8 .cse3 .cse9 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32)) .cse4) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse9 .cse4) (and .cse3 .cse4 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse3 .cse12 .cse5 .cse4 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse9 .cse4 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse0 (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse3 .cse12 .cse4 .cse5) (and .cse14 .cse3 .cse9 .cse15 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse6) (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse3 .cse4 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse3 .cse11 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse5 .cse6))) [2019-11-15 22:20:43,887 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 315) no Hoare annotation was computed. [2019-11-15 22:20:43,887 INFO L443 ceAbstractionStarter]: For program point L311-2(lines 309 321) no Hoare annotation was computed. [2019-11-15 22:20:43,887 INFO L439 ceAbstractionStarter]: At program point L146(lines 142 564) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse7 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse6 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (and .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6) .cse7) (and .cse0 .cse1 .cse7 .cse2 .cse3 (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)) .cse6))) [2019-11-15 22:20:43,887 INFO L446 ceAbstractionStarter]: At program point L609(lines 99 610) the Hoare annotation is: true [2019-11-15 22:20:43,887 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 283) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 251) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L379-2(lines 379 383) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 218) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 551) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 562) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L214-2(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,888 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 573) no Hoare annotation was computed. [2019-11-15 22:20:43,889 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 606) no Hoare annotation was computed. [2019-11-15 22:20:43,889 INFO L439 ceAbstractionStarter]: At program point L182(lines 178 552) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse6 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) .cse1 (and (and (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8)) (and .cse0 .cse1 (and .cse8 (and .cse7 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6))))) [2019-11-15 22:20:43,889 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 603) no Hoare annotation was computed. [2019-11-15 22:20:43,889 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,889 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 617) no Hoare annotation was computed. [2019-11-15 22:20:43,889 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 589) no Hoare annotation was computed. [2019-11-15 22:20:43,889 INFO L443 ceAbstractionStarter]: For program point L613-2(lines 613 617) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L443 ceAbstractionStarter]: For program point L580-2(lines 579 601) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 550) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 561) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 572) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:20:43,890 INFO L439 ceAbstractionStarter]: At program point L152(lines 148 562) the Hoare annotation is: (let ((.cse2 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse3 (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse11 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse13 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) (.cse9 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse5 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse8 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse12 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse9 .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse6 .cse7 .cse11 .cse8 .cse12 .cse13) .cse10) (and .cse9 .cse0 .cse1 .cse10 .cse4 .cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7 .cse8 .cse12))) [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 586) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 455) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L439 ceAbstractionStarter]: At program point L351(lines 68 626) the Hoare annotation is: false [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 488) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 258) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 549) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 560) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 571) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L518-1(lines 518 522) no Hoare annotation was computed. [2019-11-15 22:20:43,891 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-11-15 22:20:43,892 INFO L439 ceAbstractionStarter]: At program point L188(lines 184 550) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse7 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (and .cse1 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse3 .cse4 .cse5 .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse8 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) .cse2))) [2019-11-15 22:20:43,892 INFO L439 ceAbstractionStarter]: At program point L122(lines 118 572) the Hoare annotation is: (let ((.cse7 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse6 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse9 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) (and .cse7 .cse1 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse9))) [2019-11-15 22:20:43,892 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2019-11-15 22:20:43,894 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-11-15 22:20:43,895 INFO L443 ceAbstractionStarter]: For program point L288-2(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,895 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. [2019-11-15 22:20:43,895 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:20:43,895 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 548) no Hoare annotation was computed. [2019-11-15 22:20:43,895 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 559) no Hoare annotation was computed. [2019-11-15 22:20:43,895 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 570) no Hoare annotation was computed. [2019-11-15 22:20:43,896 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-11-15 22:20:43,897 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-15 22:20:43,897 INFO L443 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2019-11-15 22:20:43,897 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 395) no Hoare annotation was computed. [2019-11-15 22:20:43,897 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 244) no Hoare annotation was computed. [2019-11-15 22:20:43,897 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 547) no Hoare annotation was computed. [2019-11-15 22:20:43,898 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 558) no Hoare annotation was computed. [2019-11-15 22:20:43,898 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 226 244) no Hoare annotation was computed. [2019-11-15 22:20:43,898 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 569) no Hoare annotation was computed. [2019-11-15 22:20:43,898 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:20:43,898 INFO L439 ceAbstractionStarter]: At program point L194(lines 190 548) the Hoare annotation is: (let ((.cse9 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse11 (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse5 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse7 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse12 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse8 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse13 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0))) (or (and .cse0 (and .cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11 .cse4 .cse5 .cse6 .cse7 .cse0 .cse3 .cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse12 .cse8 .cse13) (and .cse9 .cse2 .cse10 .cse11 .cse4 .cse5 .cse6 .cse7 .cse0 (and .cse1 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) .cse3 .cse12 .cse8 .cse13))) [2019-11-15 22:20:43,899 INFO L439 ceAbstractionStarter]: At program point L128(lines 124 570) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse6 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)))) [2019-11-15 22:20:43,899 INFO L446 ceAbstractionStarter]: At program point L624(lines 68 626) the Hoare annotation is: true [2019-11-15 22:20:43,899 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 597) no Hoare annotation was computed. [2019-11-15 22:20:43,899 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-11-15 22:20:43,899 INFO L443 ceAbstractionStarter]: For program point L525-2(lines 525 529) no Hoare annotation was computed. [2019-11-15 22:20:43,899 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-15 22:20:43,899 INFO L446 ceAbstractionStarter]: At program point L625(lines 8 627) the Hoare annotation is: true [2019-11-15 22:20:43,900 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 464) no Hoare annotation was computed. [2019-11-15 22:20:43,900 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-11-15 22:20:43,900 INFO L443 ceAbstractionStarter]: For program point L328-2(lines 204 541) no Hoare annotation was computed. [2019-11-15 22:20:43,900 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 546) no Hoare annotation was computed. [2019-11-15 22:20:43,900 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 557) no Hoare annotation was computed. [2019-11-15 22:20:43,900 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 568) no Hoare annotation was computed. [2019-11-15 22:20:43,900 INFO L439 ceAbstractionStarter]: At program point L197(lines 196 546) the Hoare annotation is: (let ((.cse1 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse3 (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse7 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse8 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse5 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 .cse7) (and .cse0 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse8 .cse5) (and .cse2 .cse4 .cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32)) .cse5))) [2019-11-15 22:20:43,901 INFO L439 ceAbstractionStarter]: At program point L164(lines 154 560) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse5 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse7 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (and (and .cse3 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse4 .cse5 .cse6 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)) .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9)) (and .cse0 .cse1 (and (and .cse3 .cse4 .cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6) .cse7 .cse8 .cse9) .cse2))) [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 302) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 545) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 556) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 567) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 68 626) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L497-1(lines 497 509) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-11-15 22:20:43,901 INFO L446 ceAbstractionStarter]: At program point L200(lines 199 545) the Hoare annotation is: true [2019-11-15 22:20:43,902 INFO L439 ceAbstractionStarter]: At program point L134(lines 130 568) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~ag_V~0)) (.cse2 (not (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~ag_W~0)) (.cse4 (not (= (_ bv4417 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (not (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv4433 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and (and .cse0 .cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (and .cse6 .cse0 (= (_ bv100 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (= (_ bv44 32) ULTIMATE.start_ssl3_connect_~ag_X~0) .cse1 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse2 .cse3 .cse4 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse5 (= (_ bv64 32) ULTIMATE.start_ssl3_connect_~ag_Z~0)))) [2019-11-15 22:20:43,902 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-15 22:20:43,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:20:43 BoogieIcfgContainer [2019-11-15 22:20:43,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:20:43,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:20:43,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:20:43,979 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:20:43,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:20:14" (3/4) ... [2019-11-15 22:20:43,993 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:20:44,028 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 22:20:44,029 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:20:44,215 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_16124ad1-6ebe-4ba9-9783-3cc4f4fc7c32/bin/uautomizer/witness.graphml [2019-11-15 22:20:44,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:20:44,217 INFO L168 Benchmark]: Toolchain (without parser) took 31588.89 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 952.4 MB in the beginning and 834.3 MB in the end (delta: 118.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:20:44,218 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:44,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:44,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:44,219 INFO L168 Benchmark]: Boogie Preprocessor took 69.20 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:44,219 INFO L168 Benchmark]: RCFGBuilder took 841.18 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:20:44,220 INFO L168 Benchmark]: TraceAbstraction took 29747.82 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 917.5 MB). Free memory was 1.1 GB in the beginning and 834.3 MB in the end (delta: 242.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:20:44,220 INFO L168 Benchmark]: Witness Printer took 236.79 ms. Allocated memory is still 2.1 GB. Free memory is still 834.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:20:44,222 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.80 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 69.20 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 841.18 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29747.82 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 917.5 MB). Free memory was 1.1 GB in the beginning and 834.3 MB in the end (delta: 242.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 236.79 ms. Allocated memory is still 2.1 GB. Free memory is still 834.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 620]: 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: 118]: Loop Invariant Derived loop invariant: (((((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4401bv32 == s__state)) && !(4384bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) || (((((((((!(4401bv32 == s__state) && !(4432bv32 == s__state)) && 0bv32 == blastFlag) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state))) || ((((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 4352bv32 == s__state) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(5bv32 == blastFlag)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z) || ((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 100bv32 == ag_Y) && 4352bv32 == s__state) && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || ((((s__hit == 0bv32 && 4352bv32 == s__state) && 2bv32 == ag_V) && 2bv32 == blastFlag) && 5bv32 == ag_W)) || ((((4352bv32 == s__state && 2bv32 == ag_V) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32) && 5bv32 == ag_W) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32 && ((((((((!(4432bv32 == s__state) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) && !(4401bv32 == s__state)) && s__hit == 0bv32) && !(4384bv32 == s__state)) || (((!(4401bv32 == s__state) && s__hit == 0bv32) && ((((((!(4432bv32 == s__state) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) && !(4384bv32 == s__state)) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: ((((((((!(4432bv32 == s__state) && 2bv32 == ag_V) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) && s__hit == 0bv32) && !(4384bv32 == s__state)) || ((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(5bv32 == blastFlag)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4384bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4401bv32 == s__state)) && !(4384bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) || (((((((((!(4401bv32 == s__state) && !(4432bv32 == s__state)) && 0bv32 == blastFlag) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state))) || ((((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((!(4401bv32 == s__state) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) || (((!(4401bv32 == s__state) && s__hit == 0bv32) && (((((((((!(4432bv32 == s__state) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) && !(4384bv32 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((!(4401bv32 == s__state) && s__hit == 0bv32) && ((((2bv32 == ag_V && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4384bv32 == s__state)) || (((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4417bv32 == s__state)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((~bvadd64(s__state, 4294955004bv32) == 0bv32 && 0bv32 == blastFlag) && 2bv32 == ag_V) && 5bv32 == ag_W) || ((((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(5bv32 == blastFlag)) && 5bv32 == ag_W) && ~bvadd64(s__state, 4294955004bv32) == 0bv32) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || ((((~bvadd64(s__state, 4294955004bv32) == 0bv32 && s__hit == 0bv32) && 2bv32 == ag_V) && 2bv32 == blastFlag) && 5bv32 == ag_W) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4384bv32 == s__state)) && (((!(4432bv32 == s__state) && !(4416bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && (((((100bv32 == ag_Y && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 5bv32 == ag_W) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) && !(4417bv32 == s__state)) || (((!(4401bv32 == s__state) && s__hit == 0bv32) && ((((((!(4432bv32 == s__state) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 5bv32 == ag_W) && !(4433bv32 == s__state)) && !(4416bv32 == s__state)) && !(4417bv32 == s__state)) && !(4384bv32 == s__state)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && 4496bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z) || (((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && 4464bv32 == s__state) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || (((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && 4528bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || ((((4352bv32 == s__state && 2bv32 == ag_V) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32) && 5bv32 == ag_W)) || ((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && 4560bv32 == s__state) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || (((4528bv32 == s__state && 2bv32 == ag_V) && 2bv32 == blastFlag) && 5bv32 == ag_W)) || (((2bv32 == ag_V && 5bv32 == ag_W) && 1bv32 == blastFlag) && 4384bv32 == s__state)) || (((((s__hit == 0bv32 && 2bv32 == ag_V) && !(5bv32 == blastFlag)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 5bv32 == ag_W) && 4432bv32 == s__state)) || (((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && 4512bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || (((s__hit == 0bv32 && 2bv32 == ag_V) && 2bv32 == blastFlag) && 5bv32 == ag_W)) || ((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 100bv32 == ag_Y) && 4352bv32 == s__state) && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || (((2bv32 == ag_V && 2bv32 == blastFlag) && 5bv32 == ag_W) && 4512bv32 == s__state)) || (((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(5bv32 == blastFlag)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || (((((s__hit == 0bv32 && 4416bv32 == s__state) && 2bv32 == ag_V) && !(5bv32 == blastFlag)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((~bvadd64(s__state, 4294967293bv32) == 0bv32 && 2bv32 == ag_V) && 2bv32 == blastFlag) && !(4432bv32 == s__s3__tmp__next_state___0)) && 5bv32 == ag_W)) || (((((((100bv32 == ag_Y && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && ~bvadd64(s__state, 4294967293bv32) == 0bv32) && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z)) || (((0bv32 == blastFlag && 2bv32 == ag_V) && 5bv32 == ag_W) && 4368bv32 == s__state)) || (((2bv32 == ag_V && 4560bv32 == s__state) && 2bv32 == blastFlag) && 5bv32 == ag_W)) || (((((((s__hit == 0bv32 && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && 5bv32 == ag_W) && 4480bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 64bv32 == ag_Z) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((!(4401bv32 == s__state) && !(4432bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && 1bv32 == blastFlag) && !(4433bv32 == s__state)) || (((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state))) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4401bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4384bv32 == s__state)) && (((((((((100bv32 == ag_Y && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) && !(4432bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4417bv32 == s__state)) || ((!(4401bv32 == s__state) && !(4384bv32 == s__state)) && !(4417bv32 == s__state) && (((((!(4432bv32 == s__state) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4433bv32 == s__state)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) || ((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 5bv32 == ag_W) && !(4433bv32 == s__state)) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((((!(4401bv32 == s__state) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) || ((((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4401bv32 == s__state)) && !(4384bv32 == s__state)) && !(4400bv32 == s__state)) && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z)) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4401bv32 == s__state)) && !(4400bv32 == s__state) && !(5bv32 == blastFlag)) && !(4384bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4401bv32 == s__state)) && !(4384bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) || (((!(4401bv32 == s__state) && s__hit == 0bv32) && ((((((((((!(4432bv32 == s__state) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && !(4432bv32 == s__s3__tmp__next_state___0)) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) && 64bv32 == ag_Z) && !(4384bv32 == s__state))) || ((((((((((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4384bv32 == s__state)) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(4416bv32 == s__state)) && 5bv32 == ag_W) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((!(4401bv32 == s__state) && s__hit == 0bv32) && !(4384bv32 == s__state)) && (((((((((!(4432bv32 == s__state) && 100bv32 == ag_Y) && 44bv32 == ag_X) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 5bv32 == ag_W) && 64bv32 == ag_Z) && !(4416bv32 == s__state)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) || (((!(4401bv32 == s__state) && s__hit == 0bv32) && ((((((!(4432bv32 == s__state) && 2bv32 == ag_V) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 5bv32 == ag_W) && !(4416bv32 == s__state)) && !(4417bv32 == s__state)) && !(4433bv32 == s__state)) && !(4384bv32 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: SAFE, OverallTime: 29.6s, OverallIterations: 21, TraceHistogramMax: 16, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, HoareTripleCheckerStatistics: 3792 SDtfs, 2980 SDslu, 3333 SDs, 0 SdLazy, 3116 SolverSat, 609 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7745 GetRequests, 7694 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14697occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 5959 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 532 NumberOfFragments, 1997 HoareAnnotationTreeSize, 23 FomulaSimplifications, 44015 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 17933 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3885 NumberOfCodeBlocks, 3885 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7728 ConstructedInterpolants, 0 QuantifiedInterpolants, 3195463 SizeOfPredicates, 20 NumberOfNonLiveVariables, 5114 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 42 InterpolantComputations, 36 PerfectInterpolantSequences, 22402/22794 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...