./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f ............................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:35:06,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:35:06,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:35:06,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:35:06,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:35:06,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:35:06,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:35:06,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:35:06,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:35:06,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:35:06,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:35:06,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:35:06,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:35:06,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:35:06,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:35:06,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:35:06,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:35:06,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:35:06,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:35:06,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:35:06,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:35:06,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:35:06,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:35:06,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:35:06,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:35:06,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:35:06,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:35:06,900 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:35:06,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:35:06,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:35:06,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:35:06,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:35:06,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:35:06,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:35:06,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:35:06,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:35:06,903 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 08:35:06,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:35:06,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:35:06,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:35:06,914 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 08:35:06,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:35:06,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:35:06,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:35:06,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:35:06,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:35:06,916 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:35:06,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:35:06,917 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 08:35:06,917 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 08:35:06,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:35:06,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:35:06,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 08:35:06,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:35:06,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:35:06,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:35:06,918 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 08:35:06,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:35:06,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:35:06,918 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak 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 -> Kojak 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 -> 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f [2018-11-23 08:35:06,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:35:06,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:35:06,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:35:06,951 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:35:06,951 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:35:06,952 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 08:35:06,987 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/ba4b2c9df/3a036e43a2f2489ca51c080c27eaea70/FLAGe02fc6748 [2018-11-23 08:35:07,381 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:35:07,381 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 08:35:07,385 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/ba4b2c9df/3a036e43a2f2489ca51c080c27eaea70/FLAGe02fc6748 [2018-11-23 08:35:07,394 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/ba4b2c9df/3a036e43a2f2489ca51c080c27eaea70 [2018-11-23 08:35:07,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:35:07,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:35:07,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:35:07,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:35:07,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:35:07,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ac0340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07, skipping insertion in model container [2018-11-23 08:35:07,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:35:07,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:35:07,528 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:35:07,530 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:35:07,543 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:35:07,555 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:35:07,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07 WrapperNode [2018-11-23 08:35:07,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:35:07,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:35:07,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:35:07,556 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:35:07,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:35:07,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:35:07,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:35:07,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:35:07,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:35:07,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:35:07,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:35:07,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:35:07,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 08:35:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 08:35:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:35:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 08:35:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:35:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:35:07,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:35:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:35:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:35:07,879 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:35:07,879 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 08:35:07,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:07 BoogieIcfgContainer [2018-11-23 08:35:07,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:35:07,880 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 08:35:07,880 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 08:35:07,890 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 08:35:07,890 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:07" (1/1) ... [2018-11-23 08:35:07,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:35:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 15 states and 22 transitions. [2018-11-23 08:35:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2018-11-23 08:35:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 08:35:07,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:35:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:35:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:35:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 15 states and 17 transitions. [2018-11-23 08:35:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 08:35:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 08:35:08,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:35:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:35:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:35:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:35:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:35:08,130 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := 0.0;fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; VAL [ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8);call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8);call fabs_double_#t~mem2 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4);fabs_double_~high~0 := fabs_double_#t~mem2;call write~real(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8);havoc fabs_double_#t~mem2;havoc fabs_double_#t~union3;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8);call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8);call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4);call fabs_double_#t~mem4 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8);fabs_double_~x := fabs_double_#t~mem4;call write~int(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4);call write~int(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4);havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw;havoc fabs_double_#t~mem4;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] fabs_double_#res := fabs_double_~x;main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0, |ULTIMATE.start_main_#t~short8|=false] [?] assume !main_#t~short8; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0, |ULTIMATE.start_main_#t~short8|=false] [?] assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0] [?] assume !false; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := 0.0; [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] call fabs_double_#t~mem2 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] call write~real(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset); [L28] havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] call fabs_double_#t~mem4 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] call write~int(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4); [L36] call write~int(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw; [L36] havoc fabs_double_#t~mem4; [L33] call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset); [L33] havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] assume !main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51-L54] assume !main_#t~short8; [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := 0.0; [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] call fabs_double_#t~mem2 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] call write~real(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset); [L28] havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] call fabs_double_#t~mem4 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] call write~int(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4); [L36] call write~int(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw; [L36] havoc fabs_double_#t~mem4; [L33] call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset); [L33] havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] assume !main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51-L54] assume !main_#t~short8; [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := 0.0; [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1, fabs_double_#t~mem4, fabs_double_#t~union5, fabs_double_~#sh_u~0, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] FCALL call fabs_double_~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] FCALL call fabs_double_#t~mem2 := read~int({ base: fabs_double_~#gh_u~1!base, offset: 4 + fabs_double_~#gh_u~1!offset }, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] FCALL call write~real(fabs_double_#t~union3, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] FCALL call ULTIMATE.dealloc(fabs_double_~#gh_u~1); [L28] havoc fabs_double_~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] FCALL call fabs_double_~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call fabs_double_#t~mem4 := read~real({ base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] FCALL call write~int(fabs_double_#t~union5!lsw, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call write~int(fabs_double_#t~union5!msw, { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] havoc fabs_double_#t~union5; [L36] havoc fabs_double_#t~mem4; [L33] FCALL call ULTIMATE.dealloc(fabs_double_~#sh_u~0); [L33] havoc fabs_double_~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND FALSE !(main_#t~short8) VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND TRUE !main_#t~short8 [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := 0.0; [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1, fabs_double_#t~mem4, fabs_double_#t~union5, fabs_double_~#sh_u~0, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] FCALL call fabs_double_~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] FCALL call fabs_double_#t~mem2 := read~int({ base: fabs_double_~#gh_u~1!base, offset: 4 + fabs_double_~#gh_u~1!offset }, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] FCALL call write~real(fabs_double_#t~union3, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] FCALL call ULTIMATE.dealloc(fabs_double_~#gh_u~1); [L28] havoc fabs_double_~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] FCALL call fabs_double_~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call fabs_double_#t~mem4 := read~real({ base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] FCALL call write~int(fabs_double_#t~union5!lsw, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call write~int(fabs_double_#t~union5!msw, { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] havoc fabs_double_#t~union5; [L36] havoc fabs_double_#t~mem4; [L33] FCALL call ULTIMATE.dealloc(fabs_double_~#sh_u~0); [L33] havoc fabs_double_~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND FALSE !(main_#t~short8) VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND TRUE !main_#t~short8 [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L47] ~x~0 := 0.0; [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L38] #res := ~x; [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L47] ~x~0 := 0.0; [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L38] #res := ~x; [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L47] double x = 0.0; [L26] __uint32_t high; [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() ----- [2018-11-23 08:35:08,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 08:35:08 ImpRootNode [2018-11-23 08:35:08,158 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 08:35:08,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:35:08,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:35:08,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:35:08,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:07" (3/4) ... [2018-11-23 08:35:08,163 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:35:08,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:35:08,163 INFO L168 Benchmark]: Toolchain (without parser) took 766.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:08,164 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:35:08,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:08,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:35:08,165 INFO L168 Benchmark]: Boogie Preprocessor took 58.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -215.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:08,166 INFO L168 Benchmark]: RCFGBuilder took 232.38 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:08,166 INFO L168 Benchmark]: CodeCheck took 278.92 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:08,166 INFO L168 Benchmark]: Witness Printer took 3.82 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. [2018-11-23 08:35:08,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 52]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of bitwiseAnd at line 35. Possible FailurePath: [L47] double x = 0.0; [L26] __uint32_t high; [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -215.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 232.38 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * CodeCheck took 278.92 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.82 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. 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.23-aa41828 [2018-11-23 08:35:09,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:35:09,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:35:09,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:35:09,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:35:09,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:35:09,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:35:09,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:35:09,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:35:09,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:35:09,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:35:09,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:35:09,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:35:09,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:35:09,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:35:09,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:35:09,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:35:09,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:35:09,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:35:09,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:35:09,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:35:09,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:35:09,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:35:09,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:35:09,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:35:09,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:35:09,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:35:09,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:35:09,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:35:09,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:35:09,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:35:09,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:35:09,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:35:09,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:35:09,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:35:09,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:35:09,589 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 08:35:09,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:35:09,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:35:09,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:35:09,600 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 08:35:09,601 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:35:09,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:35:09,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:35:09,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:35:09,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:35:09,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:35:09,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:35:09,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:35:09,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:35:09,603 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:35:09,603 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:35:09,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:35:09,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:35:09,603 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:35:09,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:35:09,603 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 08:35:09,604 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 08:35:09,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:35:09,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:35:09,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 08:35:09,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:35:09,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:35:09,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:35:09,605 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 08:35:09,605 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 08:35:09,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:35:09,605 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:35:09,605 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:35:09,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak 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 -> Kojak 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 -> 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f [2018-11-23 08:35:09,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:35:09,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:35:09,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:35:09,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:35:09,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:35:09,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 08:35:09,687 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/7d6bde489/7c9b1f1f156b42de826cb17526178e41/FLAG20fd52f2c [2018-11-23 08:35:10,089 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:35:10,089 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/sv-benchmarks/c/float-newlib/double_req_bl_1011a_true-unreach-call.c [2018-11-23 08:35:10,093 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/7d6bde489/7c9b1f1f156b42de826cb17526178e41/FLAG20fd52f2c [2018-11-23 08:35:10,101 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/data/7d6bde489/7c9b1f1f156b42de826cb17526178e41 [2018-11-23 08:35:10,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:35:10,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:35:10,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:35:10,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:35:10,109 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:35:10,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adfff7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10, skipping insertion in model container [2018-11-23 08:35:10,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:35:10,135 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:35:10,281 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:35:10,284 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:35:10,299 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:35:10,320 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:35:10,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10 WrapperNode [2018-11-23 08:35:10,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:35:10,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:35:10,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:35:10,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:35:10,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:35:10,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:35:10,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:35:10,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:35:10,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:35:10,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:35:10,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:35:10,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:35:10,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 08:35:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 08:35:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:35:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 08:35:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 08:35:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:35:10,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:35:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 08:35:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:35:10,554 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:35:10,573 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:35:10,596 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:35:10,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:35:10,633 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 08:35:10,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:10 BoogieIcfgContainer [2018-11-23 08:35:10,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:35:10,634 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 08:35:10,634 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 08:35:10,642 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 08:35:10,642 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:10" (1/1) ... [2018-11-23 08:35:10,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:35:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 15 states and 22 transitions. [2018-11-23 08:35:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2018-11-23 08:35:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 08:35:10,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:35:10,708 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:35:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:35:10,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:35:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:35:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 15 states and 17 transitions. [2018-11-23 08:35:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 08:35:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 08:35:10,741 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:35:10,742 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:35:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:35:10,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:35:10,807 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:10,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:10,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 08:35:10,868 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:10,869 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:10,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 08:35:10,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 08:35:10,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 08:35:10,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:35:10,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:17 [2018-11-23 08:35:10,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 08:35:10,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-23 08:35:10,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 08:35:10,952 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:10,997 INFO L267 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. [2018-11-23 08:35:10,997 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:91, output treesize:52 [2018-11-23 08:35:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:35:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-11-23 08:35:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 08:35:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 08:35:11,184 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:35:11,185 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:35:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:35:11,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:35:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:35:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 15 states and 14 transitions. [2018-11-23 08:35:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 08:35:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:35:11,205 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:35:11,206 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:35:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:35:11,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:35:11,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,259 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 08:35:11,312 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-11-23 08:35:11,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 08:35:11,329 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 08:35:11,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:35:11,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:17 [2018-11-23 08:35:11,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 08:35:11,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-23 08:35:11,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 08:35:11,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,398 INFO L267 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. [2018-11-23 08:35:11,399 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:91, output treesize:52 [2018-11-23 08:35:11,446 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,447 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 08:35:11,490 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-11-23 08:35:11,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 08:35:11,511 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:35:11,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:35:11,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:35:11,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:35:11,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:35:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:35:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:35:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 13 states and 12 transitions. [2018-11-23 08:35:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2018-11-23 08:35:11,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:35:11,958 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 5 iterations. [2018-11-23 08:35:11,964 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 08:35:11,994 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 08:35:12,000 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 08:35:12,000 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 08:35:12,001 INFO L579 CodeCheckObserver]: Invariant with dag size 12 [2018-11-23 08:35:12,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,004 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 08:35:12,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 08:35:12 ImpRootNode [2018-11-23 08:35:12,004 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 08:35:12,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:35:12,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:35:12,005 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:35:12,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:10" (3/4) ... [2018-11-23 08:35:12,008 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:35:12,015 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 08:35:12,015 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 08:35:12,015 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 08:35:12,039 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_af637962-0e3a-434d-ad2d-3dfe1fb13e9c/bin-2019/ukojak/witness.graphml [2018-11-23 08:35:12,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:35:12,040 INFO L168 Benchmark]: Toolchain (without parser) took 1935.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 951.9 MB in the beginning and 951.9 MB in the end (delta: -59.6 kB). Peak memory consumption was 105.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:12,041 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:35:12,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.04 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:12,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.01 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:35:12,042 INFO L168 Benchmark]: Boogie Preprocessor took 18.63 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:35:12,042 INFO L168 Benchmark]: RCFGBuilder took 265.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:12,043 INFO L168 Benchmark]: CodeCheck took 1370.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.0 MB in the end (delta: 114.2 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:12,043 INFO L168 Benchmark]: Witness Printer took 35.13 ms. Allocated memory is still 1.1 GB. Free memory was 959.0 MB in the beginning and 951.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:35:12,045 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 1.3s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 46 SDslu, 36 SDs, 0 SdLazy, 174 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 256 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 6 QuantifiedInterpolants, 1471 SizeOfPredicates, 17 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 52]: 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: 17]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2018-11-23 08:35:12,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-11-23 08:35:12,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_q#valueAsBitvector_6[63:32] == msw) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: x == ~Pluszero~LONGDOUBLE() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.04 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.01 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.63 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * CodeCheck took 1370.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.0 MB in the end (delta: 114.2 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. * Witness Printer took 35.13 ms. Allocated memory is still 1.1 GB. Free memory was 959.0 MB in the beginning and 951.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] RESULT: Ultimate proved your program to be correct! Received shutdown request...