./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/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 c714d208cb0b1f96f572e8a6108248eb76c73a94 .............................................................................................................................................................................................................................................................................................................................................................. 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_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/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 c714d208cb0b1f96f572e8a6108248eb76c73a94 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 09:47:32,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:47:32,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:47:32,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:47:32,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:47:32,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:47:32,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:47:32,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:47:32,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:47:32,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:47:32,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:47:32,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:47:32,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:47:32,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:47:32,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:47:32,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:47:32,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:47:32,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:47:32,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:47:32,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:47:32,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:47:32,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:47:32,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:47:32,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:47:32,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:47:32,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:47:32,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:47:32,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:47:32,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:47:32,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:47:32,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:47:32,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:47:32,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:47:32,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:47:32,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:47:32,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:47:32,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:47:32,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:47:32,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:47:32,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:47:32,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:47:32,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 09:47:32,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:47:32,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:47:32,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:47:32,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:47:32,676 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:47:32,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:47:32,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:47:32,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:47:32,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:47:32,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:47:32,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:47:32,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:47:32,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:47:32,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:47:32,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:47:32,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:47:32,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:47:32,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:47:32,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:47:32,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:47:32,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:47:32,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:47:32,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:47:32,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:47:32,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:47:32,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:47:32,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:47:32,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:47:32,682 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_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-11-20 09:47:32,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:47:32,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:47:32,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:47:32,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:47:32,825 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:47:32,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-20 09:47:32,873 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/2bd06fd30/13de7e187f864841aecb4d4aa9cd585d/FLAGd85747ba0 [2019-11-20 09:47:33,255 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:47:33,256 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-20 09:47:33,262 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/2bd06fd30/13de7e187f864841aecb4d4aa9cd585d/FLAGd85747ba0 [2019-11-20 09:47:33,275 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/2bd06fd30/13de7e187f864841aecb4d4aa9cd585d [2019-11-20 09:47:33,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:47:33,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:47:33,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:47:33,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:47:33,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:47:33,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed8d722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33, skipping insertion in model container [2019-11-20 09:47:33,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,293 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:47:33,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:47:33,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:47:33,599 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:47:33,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:47:33,671 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:47:33,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33 WrapperNode [2019-11-20 09:47:33,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:47:33,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:47:33,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:47:33,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:47:33,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:47:33,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:47:33,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:47:33,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:47:33,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... [2019-11-20 09:47:33,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:47:33,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:47:33,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:47:33,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:47:33,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/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-20 09:47:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:47:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 09:47:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:47:33,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:47:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 09:47:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:47:34,232 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:47:34,232 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 09:47:34,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:34 BoogieIcfgContainer [2019-11-20 09:47:34,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:47:34,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:47:34,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:47:34,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:47:34,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:47:33" (1/3) ... [2019-11-20 09:47:34,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fed7280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:47:34, skipping insertion in model container [2019-11-20 09:47:34,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:33" (2/3) ... [2019-11-20 09:47:34,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fed7280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:47:34, skipping insertion in model container [2019-11-20 09:47:34,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:34" (3/3) ... [2019-11-20 09:47:34,240 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2019-11-20 09:47:34,249 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:47:34,255 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 09:47:34,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 09:47:34,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:47:34,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:47:34,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:47:34,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:47:34,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:47:34,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:47:34,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:47:34,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:47:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-20 09:47:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 09:47:34,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:34,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:34,312 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:34,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:34,317 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-20 09:47:34,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:47:34,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97226680] [2019-11-20 09:47:34,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:47:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:34,445 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-20 09:47:34,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97226680] [2019-11-20 09:47:34,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:34,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:47:34,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751704513] [2019-11-20 09:47:34,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 09:47:34,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:47:34,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 09:47:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 09:47:34,463 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-20 09:47:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:34,479 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-20 09:47:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 09:47:34,481 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 09:47:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:34,496 INFO L225 Difference]: With dead ends: 56 [2019-11-20 09:47:34,496 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 09:47:34,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 09:47:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 09:47:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 09:47:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 09:47:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-20 09:47:34,536 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-20 09:47:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:34,536 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-20 09:47:34,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 09:47:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-20 09:47:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 09:47:34,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:34,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:34,538 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-20 09:47:34,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:47:34,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323783318] [2019-11-20 09:47:34,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:47:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:34,627 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-20 09:47:34,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323783318] [2019-11-20 09:47:34,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:34,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:47:34,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393661242] [2019-11-20 09:47:34,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:34,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:47:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:34,631 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-11-20 09:47:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:34,694 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-20 09:47:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:47:34,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-20 09:47:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:34,696 INFO L225 Difference]: With dead ends: 40 [2019-11-20 09:47:34,696 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 09:47:34,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:47:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 09:47:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-11-20 09:47:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:47:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-20 09:47:34,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-20 09:47:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:34,703 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-20 09:47:34,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-20 09:47:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 09:47:34,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:34,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:34,704 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-11-20 09:47:34,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:47:34,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611393819] [2019-11-20 09:47:34,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:47:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:34,769 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-20 09:47:34,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611393819] [2019-11-20 09:47:34,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:34,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:47:34,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753571766] [2019-11-20 09:47:34,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:34,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:47:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:34,771 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-11-20 09:47:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:34,827 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-11-20 09:47:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:47:34,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 09:47:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:34,829 INFO L225 Difference]: With dead ends: 42 [2019-11-20 09:47:34,829 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 09:47:34,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:47:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 09:47:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-11-20 09:47:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:47:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-20 09:47:34,834 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-11-20 09:47:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:34,835 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-20 09:47:34,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-20 09:47:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 09:47:34,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:34,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:34,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-20 09:47:34,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:47:34,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745598325] [2019-11-20 09:47:34,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:47:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:47:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:47:34,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:47:34,941 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 09:47:34,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:47:34 BoogieIcfgContainer [2019-11-20 09:47:34,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:47:34,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:47:34,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:47:34,971 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:47:34,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:34" (3/4) ... [2019-11-20 09:47:34,975 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 09:47:34,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:47:34,977 INFO L168 Benchmark]: Toolchain (without parser) took 1697.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -119.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:34,978 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:47:34,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:34,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:47:34,980 INFO L168 Benchmark]: Boogie Preprocessor took 57.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:34,980 INFO L168 Benchmark]: RCFGBuilder took 451.21 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:34,981 INFO L168 Benchmark]: TraceAbstraction took 736.16 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.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:47:34,981 INFO L168 Benchmark]: Witness Printer took 4.41 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-20 09:47:34,985 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 451.21 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 736.16 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.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.41 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; [L16] return x != x; [L62] COND TRUE !isnan_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x [L68] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 20 SDslu, 112 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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-678e011 [2019-11-20 09:47:36,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:47:36,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:47:36,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:47:36,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:47:36,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:47:36,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:47:36,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:47:36,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:47:36,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:47:36,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:47:36,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:47:36,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:47:36,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:47:36,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:47:36,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:47:36,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:47:36,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:47:36,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:47:36,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:47:36,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:47:36,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:47:36,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:47:36,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:47:36,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:47:36,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:47:36,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:47:36,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:47:36,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:47:36,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:47:36,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:47:36,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:47:36,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:47:36,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:47:36,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:47:36,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:47:36,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:47:36,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:47:36,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:47:36,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:47:36,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:47:36,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 09:47:37,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:47:37,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:47:37,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:47:37,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:47:37,004 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:47:37,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:47:37,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:47:37,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:47:37,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:47:37,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:47:37,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:47:37,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:47:37,005 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 09:47:37,005 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 09:47:37,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:47:37,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:47:37,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:47:37,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:47:37,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:47:37,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:47:37,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:47:37,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:47:37,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:47:37,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:47:37,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:47:37,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:47:37,008 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 09:47:37,008 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 09:47:37,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:47:37,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 09:47:37,009 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_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-11-20 09:47:37,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:47:37,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:47:37,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:47:37,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:47:37,288 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:47:37,289 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-20 09:47:37,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/30dfe070f/da8aa7a95d3a468c9bdee352b0a65964/FLAG98a241197 [2019-11-20 09:47:37,723 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:47:37,724 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-20 09:47:37,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/30dfe070f/da8aa7a95d3a468c9bdee352b0a65964/FLAG98a241197 [2019-11-20 09:47:38,165 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/data/30dfe070f/da8aa7a95d3a468c9bdee352b0a65964 [2019-11-20 09:47:38,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:47:38,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:47:38,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:47:38,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:47:38,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:47:38,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f01d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38, skipping insertion in model container [2019-11-20 09:47:38,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,185 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:47:38,201 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:47:38,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:47:38,389 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:47:38,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:47:38,507 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:47:38,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38 WrapperNode [2019-11-20 09:47:38,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:47:38,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:47:38,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:47:38,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:47:38,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:47:38,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:47:38,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:47:38,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:47:38,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... [2019-11-20 09:47:38,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:47:38,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:47:38,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:47:38,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:47:38,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/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-20 09:47:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 09:47:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:47:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 09:47:38,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:47:38,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:47:38,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:47:39,058 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:47:39,058 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 09:47:39,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:39 BoogieIcfgContainer [2019-11-20 09:47:39,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:47:39,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:47:39,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:47:39,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:47:39,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:47:38" (1/3) ... [2019-11-20 09:47:39,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1644ca84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:47:39, skipping insertion in model container [2019-11-20 09:47:39,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:38" (2/3) ... [2019-11-20 09:47:39,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1644ca84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:47:39, skipping insertion in model container [2019-11-20 09:47:39,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:39" (3/3) ... [2019-11-20 09:47:39,066 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2019-11-20 09:47:39,072 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:47:39,078 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 09:47:39,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 09:47:39,107 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:47:39,107 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:47:39,108 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:47:39,108 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:47:39,108 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:47:39,108 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:47:39,108 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:47:39,108 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:47:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-20 09:47:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 09:47:39,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:39,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:39,128 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-20 09:47:39,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:39,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045552604] [2019-11-20 09:47:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 09:47:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:39,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 09:47:39,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:39,231 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-20 09:47:39,231 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:39,234 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-20 09:47:39,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045552604] [2019-11-20 09:47:39,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:39,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 09:47:39,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998012159] [2019-11-20 09:47:39,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 09:47:39,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 09:47:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 09:47:39,255 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-20 09:47:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:39,272 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-20 09:47:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 09:47:39,274 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 09:47:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:39,282 INFO L225 Difference]: With dead ends: 56 [2019-11-20 09:47:39,282 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 09:47:39,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 09:47:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 09:47:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 09:47:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 09:47:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-20 09:47:39,314 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-20 09:47:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:39,314 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-20 09:47:39,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 09:47:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-20 09:47:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 09:47:39,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:39,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:39,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 09:47:39,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-20 09:47:39,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:39,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806465449] [2019-11-20 09:47:39,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 09:47:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:39,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 09:47:39,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:39,659 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-20 09:47:39,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:39,682 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-20 09:47:39,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806465449] [2019-11-20 09:47:39,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:39,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 09:47:39,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62885451] [2019-11-20 09:47:39,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:47:39,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:47:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:47:39,686 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2019-11-20 09:47:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:39,822 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-20 09:47:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:47:39,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-20 09:47:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:39,824 INFO L225 Difference]: With dead ends: 50 [2019-11-20 09:47:39,825 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 09:47:39,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:47:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 09:47:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2019-11-20 09:47:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:47:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-20 09:47:39,832 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-20 09:47:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:39,832 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-20 09:47:39,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:47:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-20 09:47:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 09:47:39,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:39,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:40,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 09:47:40,049 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:47:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-20 09:47:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:40,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763095114] [2019-11-20 09:47:40,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 09:47:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:40,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 09:47:40,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:40,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-11-20 09:47:40,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2019-11-20 09:47:40,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:40,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:40,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 09:47:40,358 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:40,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:40,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:40,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 09:47:40,389 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:40,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:40,402 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:40,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:40,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:40,424 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:33 [2019-11-20 09:47:41,740 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) c_ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 c_ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_2_3) .cse1)))) is different from true [2019-11-20 09:47:49,935 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-20 09:47:52,141 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-11-20 09:47:52,157 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-20 09:47:52,157 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:54,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:54,604 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-20 09:47:54,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:54,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 09:47:54,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:54,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 09:47:54,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:54,848 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.8 percent of original size [2019-11-20 09:47:54,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-20 09:47:54,875 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:54,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:54,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2019-11-20 09:47:54,925 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:54,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:54,946 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 09:47:55,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 09:47:55,234 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,313 INFO L567 ElimStorePlain]: treesize reduction 7, result has 92.5 percent of original size [2019-11-20 09:47:55,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-20 09:47:55,339 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-11-20 09:47:55,383 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,407 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 09:47:55,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 09:47:55,703 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,767 INFO L567 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-11-20 09:47:55,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-20 09:47:55,790 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-20 09:47:55,831 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,850 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:55,973 INFO L237 Elim1Store]: Index analysis took 107 ms [2019-11-20 09:47:55,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:55,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 09:47:56,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 09:47:56,123 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,126 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-20 09:47:56,134 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_19 vanished before elimination [2019-11-20 09:47:56,134 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_17 vanished before elimination [2019-11-20 09:47:56,134 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 09:47:56,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 09:47:56,391 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,502 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-20 09:47:56,503 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-11-20 09:47:56,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-20 09:47:56,522 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-11-20 09:47:56,561 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,576 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-20 09:47:56,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:56,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-20 09:47:56,852 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:56,855 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-20 09:47:56,863 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_25 vanished before elimination [2019-11-20 09:47:56,863 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_27 vanished before elimination [2019-11-20 09:47:56,863 INFO L496 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:57,009 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-20 09:47:57,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:57,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 09:47:57,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:57,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 09:47:57,155 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:57,158 INFO L567 ElimStorePlain]: treesize reduction 104, result has 1.0 percent of original size [2019-11-20 09:47:57,170 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_29 vanished before elimination [2019-11-20 09:47:57,170 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_32 vanished before elimination [2019-11-20 09:47:57,170 INFO L496 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:57,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:57,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-20 09:47:57,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:57,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-20 09:47:57,248 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:57,251 INFO L567 ElimStorePlain]: treesize reduction 102, result has 1.0 percent of original size [2019-11-20 09:47:57,254 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_35 vanished before elimination [2019-11-20 09:47:57,254 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_34 vanished before elimination [2019-11-20 09:47:57,255 INFO L496 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:57,369 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 09:47:57,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:57,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-11-20 09:47:57,372 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:857, output treesize:137 [2019-11-20 09:47:57,519 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-20 09:47:57,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763095114] [2019-11-20 09:47:57,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:57,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 09:47:57,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880350321] [2019-11-20 09:47:57,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 09:47:57,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 09:47:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2019-11-20 09:47:57,522 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 13 states. [2019-11-20 09:48:01,966 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-11-20 09:48:05,965 WARN L191 SmtUtils]: Spent 3.97 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 09:48:12,513 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 09:48:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:15,576 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-20 09:48:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 09:48:15,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-20 09:48:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:15,577 INFO L225 Difference]: With dead ends: 70 [2019-11-20 09:48:15,577 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 09:48:15,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=140, Invalid=323, Unknown=3, NotChecked=40, Total=506 [2019-11-20 09:48:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 09:48:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 26. [2019-11-20 09:48:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 09:48:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-20 09:48:15,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-11-20 09:48:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:15,587 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-20 09:48:15,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 09:48:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-20 09:48:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 09:48:15,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:15,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:48:15,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 09:48:15,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2019-11-20 09:48:15,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:15,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996965567] [2019-11-20 09:48:15,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:15,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 09:48:15,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:15,903 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-20 09:48:15,904 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:15,922 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-20 09:48:15,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996965567] [2019-11-20 09:48:15,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:15,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 09:48:15,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480082063] [2019-11-20 09:48:15,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:48:15,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:15,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:48:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:48:15,924 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 6 states. [2019-11-20 09:48:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:16,039 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-20 09:48:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:48:16,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-20 09:48:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:16,040 INFO L225 Difference]: With dead ends: 48 [2019-11-20 09:48:16,040 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 09:48:16,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:48:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 09:48:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2019-11-20 09:48:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:48:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-20 09:48:16,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-11-20 09:48:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:16,047 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-20 09:48:16,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:48:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-20 09:48:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:48:16,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:16,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:48:16,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 09:48:16,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2019-11-20 09:48:16,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:16,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051189035] [2019-11-20 09:48:16,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:16,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 09:48:16,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:16,352 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-20 09:48:16,352 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:16,584 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-20 09:48:16,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051189035] [2019-11-20 09:48:16,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:16,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 09:48:16,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831632798] [2019-11-20 09:48:16,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:48:16,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:48:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:48:16,586 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2019-11-20 09:48:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:16,606 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-20 09:48:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:48:16,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 09:48:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:16,608 INFO L225 Difference]: With dead ends: 33 [2019-11-20 09:48:16,608 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 09:48:16,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:48:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 09:48:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 09:48:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:48:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-20 09:48:16,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-11-20 09:48:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:16,615 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-20 09:48:16,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:48:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-20 09:48:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:48:16,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:16,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:48:16,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 09:48:16,826 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2019-11-20 09:48:16,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:16,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535459972] [2019-11-20 09:48:16,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:16,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 09:48:16,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:16,995 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-20 09:48:16,996 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:17,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:48:17,163 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-20 09:48:17,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535459972] [2019-11-20 09:48:17,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:17,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 09:48:17,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999757803] [2019-11-20 09:48:17,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:48:17,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:17,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:48:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:48:17,165 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2019-11-20 09:48:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:17,416 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-11-20 09:48:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:48:17,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 09:48:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:17,418 INFO L225 Difference]: With dead ends: 40 [2019-11-20 09:48:17,418 INFO L226 Difference]: Without dead ends: 32 [2019-11-20 09:48:17,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-20 09:48:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-20 09:48:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-20 09:48:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:48:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-20 09:48:17,423 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-20 09:48:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:17,424 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-20 09:48:17,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:48:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-20 09:48:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 09:48:17,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:17,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:48:17,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 09:48:17,642 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2019-11-20 09:48:17,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:17,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112077342] [2019-11-20 09:48:17,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:17,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 09:48:17,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:17,907 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 09:48:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:48:18,206 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-20 09:48:18,207 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:18,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:48:18,475 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-20 09:48:18,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112077342] [2019-11-20 09:48:18,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:18,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 09:48:18,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353051611] [2019-11-20 09:48:18,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 09:48:18,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 09:48:18,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:48:18,477 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2019-11-20 09:48:19,501 WARN L191 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 09:48:20,065 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-20 09:48:21,873 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-11-20 09:48:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:22,064 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-11-20 09:48:22,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 09:48:22,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-20 09:48:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:22,066 INFO L225 Difference]: With dead ends: 70 [2019-11-20 09:48:22,066 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 09:48:22,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-20 09:48:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 09:48:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-20 09:48:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 09:48:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-20 09:48:22,081 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-11-20 09:48:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:22,082 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-20 09:48:22,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 09:48:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-20 09:48:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 09:48:22,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:22,083 INFO L410 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] [2019-11-20 09:48:22,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 09:48:22,284 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2019-11-20 09:48:22,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:22,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182474448] [2019-11-20 09:48:22,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:22,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 09:48:22,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:22,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-20 09:48:22,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-20 09:48:22,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-20 09:48:22,481 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 09:48:22,502 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,511 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:48:22,526 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:30 [2019-11-20 09:48:22,553 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-20 09:48:22,553 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:22,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:48:22,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-20 09:48:22,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-20 09:48:22,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-20 09:48:22,703 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 09:48:22,731 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,754 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-20 09:48:22,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-20 09:48:22,833 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 09:48:22,871 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 09:48:22,895 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,907 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:22,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:22,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-20 09:48:22,938 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:69 [2019-11-20 09:48:23,122 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-20 09:48:23,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182474448] [2019-11-20 09:48:23,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:23,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 09:48:23,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453785676] [2019-11-20 09:48:23,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:48:23,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:23,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:48:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:48:23,126 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2019-11-20 09:48:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:23,452 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-20 09:48:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:48:23,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 09:48:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:23,454 INFO L225 Difference]: With dead ends: 44 [2019-11-20 09:48:23,454 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 09:48:23,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-20 09:48:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 09:48:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 09:48:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 09:48:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-11-20 09:48:23,461 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2019-11-20 09:48:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:23,461 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-20 09:48:23,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:48:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-11-20 09:48:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 09:48:23,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:23,464 INFO L410 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] [2019-11-20 09:48:23,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 09:48:23,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2019-11-20 09:48:23,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:23,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106518523] [2019-11-20 09:48:23,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:23,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 09:48:23,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:23,805 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-20 09:48:23,805 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:23,806 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-20 09:48:23,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106518523] [2019-11-20 09:48:23,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:23,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 09:48:23,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586063752] [2019-11-20 09:48:23,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:48:23,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:23,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:48:23,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:48:23,808 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2019-11-20 09:48:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:23,876 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-20 09:48:23,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:48:23,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-20 09:48:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:23,877 INFO L225 Difference]: With dead ends: 40 [2019-11-20 09:48:23,877 INFO L226 Difference]: Without dead ends: 24 [2019-11-20 09:48:23,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:48:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-20 09:48:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-20 09:48:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 09:48:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-11-20 09:48:23,881 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2019-11-20 09:48:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:23,881 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-11-20 09:48:23,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:48:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-11-20 09:48:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 09:48:23,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:23,882 INFO L410 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-20 09:48:24,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 09:48:24,090 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:48:24,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2019-11-20 09:48:24,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:24,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42252793] [2019-11-20 09:48:24,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-20 09:48:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:24,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 09:48:24,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:24,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:48:24,381 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 09:48:24,662 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-20 09:48:24,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:24,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:48:25,030 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-20 09:48:25,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42252793] [2019-11-20 09:48:25,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:48:25,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-20 09:48:25,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933804132] [2019-11-20 09:48:25,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 09:48:25,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 09:48:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:48:25,031 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 16 states. [2019-11-20 09:48:29,582 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-20 09:48:29,729 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-20 09:48:30,052 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-20 09:48:30,331 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-20 09:48:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:30,332 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-20 09:48:30,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 09:48:30,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 09:48:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:30,332 INFO L225 Difference]: With dead ends: 24 [2019-11-20 09:48:30,333 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:48:30,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-20 09:48:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:48:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:48:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:48:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:48:30,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-20 09:48:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:30,334 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:48:30,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 09:48:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:48:30,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:48:30,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 09:48:30,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 09:48:30,693 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 184 [2019-11-20 09:48:33,119 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 184 DAG size of output: 29 [2019-11-20 09:48:35,631 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 178 DAG size of output: 38 [2019-11-20 09:48:35,746 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 17 [2019-11-20 09:48:38,560 WARN L191 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 176 DAG size of output: 48 [2019-11-20 09:48:38,561 INFO L447 ceAbstractionStarter]: At program point L73(lines 53 74) the Hoare annotation is: true [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y .cse0) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L440 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) .cse0)))) [2019-11-20 09:48:38,562 INFO L444 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2019-11-20 09:48:38,562 INFO L440 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L440 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 .cse0) (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) ULTIMATE.start_fmin_double_~x) (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start___fpclassify_double_~msw~0))) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (or (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)) (and (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32)) (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32))) (= (_ bv0 32) ULTIMATE.start___fpclassify_double_~lsw~0)) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-20 09:48:38,563 INFO L440 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_skolemized_v_prenex_3_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_7|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_3_3) ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) .cse1)))) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L62-2(lines 62 71) no Hoare annotation was computed. [2019-11-20 09:48:38,563 INFO L444 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-20 09:48:38,564 INFO L444 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2019-11-20 09:48:38,564 INFO L440 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq |ULTIMATE.start_fmin_double_#res| ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))))) [2019-11-20 09:48:38,564 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 70) no Hoare annotation was computed. [2019-11-20 09:48:38,564 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-20 09:48:38,564 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2019-11-20 09:48:38,564 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2019-11-20 09:48:38,564 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-20 09:48:38,569 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,570 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,570 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,576 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,581 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,586 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,586 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,599 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,602 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,602 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,602 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,603 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,606 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:48:38 BoogieIcfgContainer [2019-11-20 09:48:38,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:48:38,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:48:38,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:48:38,609 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:48:38,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:39" (3/4) ... [2019-11-20 09:48:38,612 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:48:38,622 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-20 09:48:38,623 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 09:48:38,623 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 09:48:38,646 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) [2019-11-20 09:48:38,646 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x) [2019-11-20 09:48:38,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_2_4 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) == x && v_skolemized_v_prenex_2_4[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && !(0bv32 == \result)) && 0bv32 == \result) && x == x) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-20 09:48:38,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2019-11-20 09:48:38,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-20 09:48:38,648 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result [2019-11-20 09:48:38,669 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4901f66f-81bc-4c9e-a72a-5d90e75e1a20/bin/uautomizer/witness.graphml [2019-11-20 09:48:38,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:48:38,671 INFO L168 Benchmark]: Toolchain (without parser) took 60500.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 956.4 MB in the beginning and 888.7 MB in the end (delta: 67.7 MB). Peak memory consumption was 328.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:38,671 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:48:38,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:38,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:38,672 INFO L168 Benchmark]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:48:38,672 INFO L168 Benchmark]: RCFGBuilder took 472.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:38,673 INFO L168 Benchmark]: TraceAbstraction took 59547.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 888.7 MB in the end (delta: 238.8 MB). Peak memory consumption was 338.4 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:38,674 INFO L168 Benchmark]: Witness Printer took 60.82 ms. Allocated memory is still 1.3 GB. Free memory was 888.7 MB in the beginning and 888.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-20 09:48:38,677 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 472.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59547.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 888.7 MB in the end (delta: 238.8 MB). Peak memory consumption was 338.4 MB. Max. memory is 11.5 GB. * Witness Printer took 60.82 ms. Allocated memory is still 1.3 GB. Free memory was 888.7 MB in the beginning and 888.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: 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: 44]: Loop Invariant [2019-11-20 09:48:38,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-20 09:48:38,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 16]: Loop Invariant [2019-11-20 09:48:38,692 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,692 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 20]: Loop Invariant [2019-11-20 09:48:38,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x) - InvariantResult [Line: 17]: Loop Invariant [2019-11-20 09:48:38,694 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,696 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-20 09:48:38,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 09:48:38,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result - InvariantResult [Line: 20]: Loop Invariant [2019-11-20 09:48:38,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2019-11-20 09:48:38,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-20 09:48:38,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-20 09:48:38,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_2_4 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) == x && v_skolemized_v_prenex_2_4[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && !(0bv32 == \result)) && 0bv32 == \result) && x == x) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 59.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, HoareTripleCheckerStatistics: 268 SDtfs, 696 SDslu, 493 SDs, 0 SdLazy, 362 SolverSat, 52 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 38.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 248 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12268 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 74 QuantifiedInterpolants, 70858 SizeOfPredicates, 62 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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...