./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0730c_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_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0730c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/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 fb0b06f0fabe52e4995034e0b478ee6377b6d993 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0730c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/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 fb0b06f0fabe52e4995034e0b478ee6377b6d993 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:49:59,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:49:59,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:49:59,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:49:59,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:49:59,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:49:59,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:49:59,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:49:59,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:49:59,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:49:59,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:49:59,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:49:59,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:49:59,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:49:59,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:49:59,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:49:59,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:49:59,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:49:59,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:49:59,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:49:59,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:49:59,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:49:59,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:49:59,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:49:59,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:49:59,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:49:59,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:49:59,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:49:59,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:49:59,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:49:59,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:49:59,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:49:59,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:49:59,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:49:59,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:49:59,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:49:59,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 13:49:59,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:49:59,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:49:59,828 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:49:59,828 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:49:59,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:49:59,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:49:59,829 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:49:59,829 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:49:59,829 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:49:59,829 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:49:59,829 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:49:59,830 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:49:59,830 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:49:59,831 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:49:59,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:49:59,831 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:49:59,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:49:59,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:49:59,831 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:49:59,831 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:49:59,831 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:49:59,832 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:49:59,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:49:59,832 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_200e0acc-e1bf-412c-8ad9-421e251b5088/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 -> fb0b06f0fabe52e4995034e0b478ee6377b6d993 [2018-11-23 13:49:59,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:49:59,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:49:59,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:49:59,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:49:59,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:49:59,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-11-23 13:49:59,908 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/a5046866e/96a4b97072d545299411ad02b8f5d7bc/FLAGe20b353c6 [2018-11-23 13:50:00,221 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:50:00,222 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/sv-benchmarks/c/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-11-23 13:50:00,228 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/a5046866e/96a4b97072d545299411ad02b8f5d7bc/FLAGe20b353c6 [2018-11-23 13:50:00,238 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/a5046866e/96a4b97072d545299411ad02b8f5d7bc [2018-11-23 13:50:00,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:50:00,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:50:00,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:50:00,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:50:00,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:50:00,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242fcc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00, skipping insertion in model container [2018-11-23 13:50:00,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:50:00,270 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:50:00,407 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:50:00,410 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:50:00,439 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:50:00,490 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:50:00,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00 WrapperNode [2018-11-23 13:50:00,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:50:00,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:50:00,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:50:00,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:50:00,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:50:00,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:50:00,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:50:00,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:50:00,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2018-11-23 13:50:00,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:50:00,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:50:00,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:50:00,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:50:00,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/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 13:50:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:50:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:50:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:50:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:50:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:50:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:50:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:50:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:50:01,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:50:01,113 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 13:50:01,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:01 BoogieIcfgContainer [2018-11-23 13:50:01,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:50:01,114 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:50:01,114 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:50:01,120 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:50:01,121 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:01" (1/1) ... [2018-11-23 13:50:01,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 27 states and 43 transitions. [2018-11-23 13:50:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2018-11-23 13:50:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:50:01,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:01,215 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 13:50:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2018-11-23 13:50:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2018-11-23 13:50:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:50:01,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:01,302 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];~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-300;havoc main_#res;havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0;main_~x~0 := 0.0;__ieee754_sqrt_#in~x := main_~x~0;havoc __ieee754_sqrt_#res;havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6.lsw, __ieee754_sqrt_#t~union6.msw, __ieee754_sqrt_~#iw_u~0.base, __ieee754_sqrt_~#iw_u~0.offset, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0;__ieee754_sqrt_~x := __ieee754_sqrt_#in~x;havoc __ieee754_sqrt_~z~0;__ieee754_sqrt_~sign~0 := -2147483648;havoc __ieee754_sqrt_~r~0;havoc __ieee754_sqrt_~t1~0;havoc __ieee754_sqrt_~s1~0;havoc __ieee754_sqrt_~ix1~0;havoc __ieee754_sqrt_~q1~0;havoc __ieee754_sqrt_~ix0~0;havoc __ieee754_sqrt_~s0~0;havoc __ieee754_sqrt_~q~0;havoc __ieee754_sqrt_~m~0;havoc __ieee754_sqrt_~t~0;havoc __ieee754_sqrt_~i~0; VAL [ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] call __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(__ieee754_sqrt_~x, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8);call __ieee754_sqrt_#t~mem0 := read~int(__ieee754_sqrt_~#ew_u~0.base, 4 + __ieee754_sqrt_~#ew_u~0.offset, 4);__ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(__ieee754_sqrt_#t~union1, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8);havoc __ieee754_sqrt_#t~mem0;havoc __ieee754_sqrt_#t~union1;call __ieee754_sqrt_#t~mem2 := read~int(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 4);__ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2;call write~real(__ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8);havoc __ieee754_sqrt_#t~union3;havoc __ieee754_sqrt_#t~mem2;call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset);havoc __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] goto; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072);__ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] main_#t~ret9 := __ieee754_sqrt_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9;main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, |ULTIMATE.start_main_#t~short11|=false, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !main_#t~short11; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, |ULTIMATE.start_main_#t~short11|=false, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !main_#t~short11;havoc main_#t~short11;havoc main_#t~ret10; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] assume !false; VAL [ULTIMATE.start___ieee754_sqrt_~ix0~0=6333, ULTIMATE.start___ieee754_sqrt_~ix1~0=3, ULTIMATE.start___ieee754_sqrt_~sign~0=(- 2147483648), ULTIMATE.start___ieee754_sqrt_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrt_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrt_#res|=5.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := 0.0; [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6.lsw, __ieee754_sqrt_#t~union6.msw, __ieee754_sqrt_~#iw_u~0.base, __ieee754_sqrt_~#iw_u~0.offset, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] call __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset := #Ultimate.alloc(8); [L27] call write~real(__ieee754_sqrt_~x, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] call __ieee754_sqrt_#t~mem0 := read~int(__ieee754_sqrt_~#ew_u~0.base, 4 + __ieee754_sqrt_~#ew_u~0.offset, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] call write~real(__ieee754_sqrt_#t~union1, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] call __ieee754_sqrt_#t~mem2 := read~int(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] call write~real(__ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset); [L26] havoc __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32-L34] assume 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072); [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153-L156] assume !main_#t~short11; [L153] havoc main_#t~short11; [L153] havoc main_#t~ret10; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := 0.0; [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6.lsw, __ieee754_sqrt_#t~union6.msw, __ieee754_sqrt_~#iw_u~0.base, __ieee754_sqrt_~#iw_u~0.offset, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] call __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset := #Ultimate.alloc(8); [L27] call write~real(__ieee754_sqrt_~x, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] call __ieee754_sqrt_#t~mem0 := read~int(__ieee754_sqrt_~#ew_u~0.base, 4 + __ieee754_sqrt_~#ew_u~0.offset, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] call write~real(__ieee754_sqrt_#t~union1, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] call __ieee754_sqrt_#t~mem2 := read~int(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] call write~real(__ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset); [L26] havoc __ieee754_sqrt_~#ew_u~0.base, __ieee754_sqrt_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32-L34] assume 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072); [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153-L156] assume !main_#t~short11; [L153] havoc main_#t~short11; [L153] havoc main_#t~ret10; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := 0.0; [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6, __ieee754_sqrt_~#iw_u~0, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call __ieee754_sqrt_~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(__ieee754_sqrt_~x, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] FCALL call __ieee754_sqrt_#t~mem0 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: 4 + __ieee754_sqrt_~#ew_u~0!offset }, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(__ieee754_sqrt_#t~union1, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] FCALL call __ieee754_sqrt_#t~mem2 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] FCALL call write~real(__ieee754_sqrt_#t~union3, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] FCALL call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0); [L26] havoc __ieee754_sqrt_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072) [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !main_#t~short11 [L153] havoc main_#t~short11; [L153] havoc main_#t~ret10; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~res~0; [L149] main_~x~0 := 0.0; [L150] __ieee754_sqrt_#in~x := main_~x~0; [L150] havoc __ieee754_sqrt_#res; [L150] havoc __ieee754_sqrt_#t~mem0, __ieee754_sqrt_#t~union1, __ieee754_sqrt_#t~mem2, __ieee754_sqrt_#t~union3, __ieee754_sqrt_~#ew_u~0, __ieee754_sqrt_#t~post4, __ieee754_sqrt_#t~mem5, __ieee754_sqrt_#t~union6, __ieee754_sqrt_~#iw_u~0, __ieee754_sqrt_~x, __ieee754_sqrt_~z~0, __ieee754_sqrt_~sign~0, __ieee754_sqrt_~r~0, __ieee754_sqrt_~t1~0, __ieee754_sqrt_~s1~0, __ieee754_sqrt_~ix1~0, __ieee754_sqrt_~q1~0, __ieee754_sqrt_~ix0~0, __ieee754_sqrt_~s0~0, __ieee754_sqrt_~q~0, __ieee754_sqrt_~m~0, __ieee754_sqrt_~t~0, __ieee754_sqrt_~i~0; [L19-L127] __ieee754_sqrt_~x := __ieee754_sqrt_#in~x; [L20] havoc __ieee754_sqrt_~z~0; [L21] __ieee754_sqrt_~sign~0 := -2147483648; [L22] havoc __ieee754_sqrt_~r~0; [L22] havoc __ieee754_sqrt_~t1~0; [L22] havoc __ieee754_sqrt_~s1~0; [L22] havoc __ieee754_sqrt_~ix1~0; [L22] havoc __ieee754_sqrt_~q1~0; [L23] havoc __ieee754_sqrt_~ix0~0; [L23] havoc __ieee754_sqrt_~s0~0; [L23] havoc __ieee754_sqrt_~q~0; [L23] havoc __ieee754_sqrt_~m~0; [L23] havoc __ieee754_sqrt_~t~0; [L23] havoc __ieee754_sqrt_~i~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call __ieee754_sqrt_~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(__ieee754_sqrt_~x, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] FCALL call __ieee754_sqrt_#t~mem0 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: 4 + __ieee754_sqrt_~#ew_u~0!offset }, 4); [L28] __ieee754_sqrt_~ix0~0 := (if __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrt_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(__ieee754_sqrt_#t~union1, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L28] havoc __ieee754_sqrt_#t~mem0; [L28] havoc __ieee754_sqrt_#t~union1; [L29] FCALL call __ieee754_sqrt_#t~mem2 := read~int({ base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 4); [L29] __ieee754_sqrt_~ix1~0 := __ieee754_sqrt_#t~mem2; [L29] FCALL call write~real(__ieee754_sqrt_#t~union3, { base: __ieee754_sqrt_~#ew_u~0!base, offset: __ieee754_sqrt_~#ew_u~0!offset }, 8); [L29] havoc __ieee754_sqrt_#t~union3; [L29] havoc __ieee754_sqrt_#t~mem2; [L26] FCALL call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0); [L26] havoc __ieee754_sqrt_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(__ieee754_sqrt_~ix0~0, 2146435072) [L33] __ieee754_sqrt_#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x, __ieee754_sqrt_~x), __ieee754_sqrt_~x); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] main_#t~ret9 := __ieee754_sqrt_#res; [L150] main_~res~0 := main_#t~ret9; [L150] havoc main_#t~ret9; [L153] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_#t~short11=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !main_#t~short11 [L153] havoc main_#t~short11; [L153] havoc main_#t~ret10; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrt_#in~x=0.0, __ieee754_sqrt_#res=5.0, __ieee754_sqrt_~ix0~0=6333, __ieee754_sqrt_~ix1~0=3, __ieee754_sqrt_~sign~0=-2147483648, __ieee754_sqrt_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [L149] ~x~0 := 0.0; [L19-L127] ~x := #in~x; [L20] havoc ~z~0; [L21] ~sign~0 := -2147483648; [L22] havoc ~r~0; [L22] havoc ~t1~0; [L22] havoc ~s1~0; [L22] havoc ~ix1~0; [L22] havoc ~q1~0; [L23] havoc ~ix0~0; [L23] havoc ~s0~0; [L23] havoc ~q~0; [L23] havoc ~m~0; [L23] havoc ~t~0; [L23] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L28] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] havoc #t~mem0; [L28] havoc #t~union1; [L29] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L29] ~ix1~0 := #t~mem2; [L29] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union3; [L29] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L26] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L33] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] ~res~0 := #t~ret9; [L150] havoc #t~ret9; [L153] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !#t~short11 [L153] havoc #t~short11; [L153] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~one_sqrt~0 := 1.0; [L17] ~tiny_sqrt~0 := 1.0E-300; [L149] ~x~0 := 0.0; [L19-L127] ~x := #in~x; [L20] havoc ~z~0; [L21] ~sign~0 := -2147483648; [L22] havoc ~r~0; [L22] havoc ~t1~0; [L22] havoc ~s1~0; [L22] havoc ~ix1~0; [L22] havoc ~q1~0; [L23] havoc ~ix0~0; [L23] havoc ~s0~0; [L23] havoc ~q~0; [L23] havoc ~m~0; [L23] havoc ~t~0; [L23] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L27] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L28] ~ix0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L28] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L28] havoc #t~mem0; [L28] havoc #t~union1; [L29] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L29] ~ix1~0 := #t~mem2; [L29] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union3; [L29] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L26] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L32] COND TRUE 2146435072 == ~bitwiseAnd(~ix0~0, 2146435072) [L33] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~x), ~x); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] ~res~0 := #t~ret9; [L150] havoc #t~ret9; [L153] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !#t~short11 [L153] havoc #t~short11; [L153] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L154] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L149] double x = 0.0; [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (ix0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (ix1) = ew_u.parts.lsw [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L154] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- [2018-11-23 13:50:01,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:50:01 ImpRootNode [2018-11-23 13:50:01,350 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:50:01,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:50:01,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:50:01,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:50:01,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:01" (3/4) ... [2018-11-23 13:50:01,357 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:50:01,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:50:01,358 INFO L168 Benchmark]: Toolchain (without parser) took 1116.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -66.7 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:01,359 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:50:01,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:01,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:01,361 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 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 13:50:01,361 INFO L168 Benchmark]: RCFGBuilder took 559.85 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:01,361 INFO L168 Benchmark]: CodeCheck took 236.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:01,362 INFO L168 Benchmark]: Witness Printer took 7.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:01,365 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, 53 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 52 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, 15 NumberOfCodeBlocks, 15 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: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33, overapproximation of bitwiseAnd at line 32. Possible FailurePath: [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L149] double x = 0.0; [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (ix0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (ix1) = ew_u.parts.lsw [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L154] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] * 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.19 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. * RCFGBuilder took 559.85 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * CodeCheck took 236.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. 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 13:50:02,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:50:02,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:50:02,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:50:02,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:50:02,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:50:02,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:50:02,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:50:02,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:50:02,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:50:02,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:50:02,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:50:02,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:50:02,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:50:02,760 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:50:02,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:50:02,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:50:02,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:50:02,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:50:02,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:50:02,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:50:02,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:50:02,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:50:02,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:50:02,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:50:02,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:50:02,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:50:02,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:50:02,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:50:02,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:50:02,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:50:02,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:50:02,773 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:50:02,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:50:02,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:50:02,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:50:02,774 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 13:50:02,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:50:02,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:50:02,786 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:50:02,786 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:50:02,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:50:02,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:50:02,787 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:50:02,788 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:50:02,788 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:50:02,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:50:02,789 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:50:02,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:50:02,789 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:50:02,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:50:02,789 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:50:02,789 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 13:50:02,789 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 13:50:02,790 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:50:02,790 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:50:02,790 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:50:02,790 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_200e0acc-e1bf-412c-8ad9-421e251b5088/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 -> fb0b06f0fabe52e4995034e0b478ee6377b6d993 [2018-11-23 13:50:02,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:50:02,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:50:02,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:50:02,828 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:50:02,828 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:50:02,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-11-23 13:50:02,864 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/960978a5b/cbc27b0e80004f678da84b4f8d351ca1/FLAG2bbc21314 [2018-11-23 13:50:03,265 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:50:03,266 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/sv-benchmarks/c/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-11-23 13:50:03,270 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/960978a5b/cbc27b0e80004f678da84b4f8d351ca1/FLAG2bbc21314 [2018-11-23 13:50:03,278 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/data/960978a5b/cbc27b0e80004f678da84b4f8d351ca1 [2018-11-23 13:50:03,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:50:03,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:50:03,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:50:03,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:50:03,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:50:03,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cd9765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03, skipping insertion in model container [2018-11-23 13:50:03,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:50:03,313 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:50:03,464 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:50:03,468 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:50:03,500 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:50:03,523 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:50:03,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03 WrapperNode [2018-11-23 13:50:03,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:50:03,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:50:03,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:50:03,525 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:50:03,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:50:03,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:50:03,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:50:03,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:50:03,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... [2018-11-23 13:50:03,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:50:03,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:50:03,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:50:03,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:50:03,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/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 13:50:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 13:50:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:50:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:50:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:50:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:50:03,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:50:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:50:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:50:03,837 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:50:06,275 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:50:08,101 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:50:08,101 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 13:50:08,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:08 BoogieIcfgContainer [2018-11-23 13:50:08,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:50:08,102 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:50:08,102 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:50:08,108 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:50:08,109 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:08" (1/1) ... [2018-11-23 13:50:08,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 27 states and 43 transitions. [2018-11-23 13:50:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2018-11-23 13:50:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:50:08,140 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:08,179 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:08,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:08,215 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 13:50:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2018-11-23 13:50:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2018-11-23 13:50:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:50:08,225 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:08,226 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:08,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:08,370 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 13:50:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 27 states and 39 transitions. [2018-11-23 13:50:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-11-23 13:50:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:50:11,681 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:11,682 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:11,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:11,731 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 13:50:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 29 states and 42 transitions. [2018-11-23 13:50:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2018-11-23 13:50:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:50:24,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:24,559 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:25,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:25,304 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 13:50:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 29 states and 40 transitions. [2018-11-23 13:50:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-11-23 13:50:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:50:29,341 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:29,342 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:29,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:29,356 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 13:50:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 29 states and 38 transitions. [2018-11-23 13:50:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-11-23 13:50:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:50:29,360 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:29,361 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:29,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:29,477 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:50:29,478 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:50:29,482 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 13:50:29,522 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:50:29,522 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:50:29,523 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 13:50:29,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:29,536 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 13:50:29,540 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:50:29,541 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 13:50:29,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:29,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:29,547 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 13:50:29,553 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 13:50:29,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 13:50:29,604 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 13:50:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2018-11-23 13:50:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2018-11-23 13:50:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:50:29,922 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:29,923 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:29,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:29,958 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 13:50:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 34 states and 42 transitions. [2018-11-23 13:50:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-11-23 13:50:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:50:29,962 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:29,963 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:30,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:30,043 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 13:50:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 35 states and 44 transitions. [2018-11-23 13:50:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2018-11-23 13:50:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:50:30,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:30,106 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:30,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:50:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 39 states and 51 transitions. [2018-11-23 13:50:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-11-23 13:50:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:50:31,465 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:31,466 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:31,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 39 states and 50 transitions. [2018-11-23 13:50:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-23 13:50:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:50:32,381 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:32,382 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:32,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:50:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 36 states and 44 transitions. [2018-11-23 13:50:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:50:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:50:32,429 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:32,430 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:32,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 37 states and 45 transitions. [2018-11-23 13:50:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 13:50:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:50:32,788 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:32,789 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:32,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 38 states and 47 transitions. [2018-11-23 13:50:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 13:50:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:50:33,236 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:33,237 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:33,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2018-11-23 13:50:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 13:50:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:50:33,646 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:33,646 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:33,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 40 states and 51 transitions. [2018-11-23 13:50:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-11-23 13:50:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:50:34,125 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:34,126 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:34,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 41 states and 53 transitions. [2018-11-23 13:50:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 13:50:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:50:34,615 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:34,615 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:34,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 42 states and 55 transitions. [2018-11-23 13:50:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 13:50:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:50:35,135 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:35,136 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:35,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 43 states and 57 transitions. [2018-11-23 13:50:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2018-11-23 13:50:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:50:35,665 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:35,666 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:35,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 44 states and 59 transitions. [2018-11-23 13:50:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2018-11-23 13:50:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:50:36,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:36,207 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:36,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 45 states and 61 transitions. [2018-11-23 13:50:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2018-11-23 13:50:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:50:36,756 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:36,757 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:36,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 46 states and 63 transitions. [2018-11-23 13:50:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2018-11-23 13:50:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:50:37,385 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:37,385 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:37,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 47 states and 65 transitions. [2018-11-23 13:50:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2018-11-23 13:50:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:50:38,046 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:38,046 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:38,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 48 states and 67 transitions. [2018-11-23 13:50:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2018-11-23 13:50:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:50:38,813 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:38,814 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:38,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 49 states and 69 transitions. [2018-11-23 13:50:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2018-11-23 13:50:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:50:39,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:39,558 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:39,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 50 states and 71 transitions. [2018-11-23 13:50:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2018-11-23 13:50:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:50:40,267 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:40,268 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:40,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 51 states and 73 transitions. [2018-11-23 13:50:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2018-11-23 13:50:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:50:41,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:41,010 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:41,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 52 states and 75 transitions. [2018-11-23 13:50:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2018-11-23 13:50:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 13:50:41,771 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:41,772 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:41,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 53 states and 77 transitions. [2018-11-23 13:50:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2018-11-23 13:50:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:50:42,587 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:42,588 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:42,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 54 states and 79 transitions. [2018-11-23 13:50:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2018-11-23 13:50:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:50:43,505 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:43,505 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:43,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 55 states and 81 transitions. [2018-11-23 13:50:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2018-11-23 13:50:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:50:44,396 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:44,397 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:44,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 56 states and 83 transitions. [2018-11-23 13:50:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2018-11-23 13:50:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:50:45,302 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:45,302 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:45,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 57 states and 85 transitions. [2018-11-23 13:50:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2018-11-23 13:50:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:50:46,270 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:46,271 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:46,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:50:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 58 states and 87 transitions. [2018-11-23 13:50:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2018-11-23 13:50:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:50:47,262 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:47,263 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:47,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 59 states and 89 transitions. [2018-11-23 13:50:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-11-23 13:50:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:50:47,946 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:47,946 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:48,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 60 states and 91 transitions. [2018-11-23 13:50:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2018-11-23 13:50:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:50:48,582 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:48,582 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:48,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 61 states and 93 transitions. [2018-11-23 13:50:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2018-11-23 13:50:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:50:49,525 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:49,526 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:49,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 62 states and 95 transitions. [2018-11-23 13:50:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2018-11-23 13:50:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:50:50,210 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:50,211 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:50,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 63 states and 97 transitions. [2018-11-23 13:50:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2018-11-23 13:50:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:50:50,941 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:50,942 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:51,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 64 states and 99 transitions. [2018-11-23 13:50:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2018-11-23 13:50:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:50:51,699 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:51,700 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:51,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 65 states and 101 transitions. [2018-11-23 13:50:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2018-11-23 13:50:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:50:52,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:52,492 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:52,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 66 states and 103 transitions. [2018-11-23 13:50:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2018-11-23 13:50:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 13:50:53,285 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:53,286 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:53,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 67 states and 105 transitions. [2018-11-23 13:50:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2018-11-23 13:50:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:50:54,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:54,142 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:54,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 68 states and 107 transitions. [2018-11-23 13:50:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2018-11-23 13:50:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 13:50:55,031 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:55,031 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:55,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 69 states and 109 transitions. [2018-11-23 13:50:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 109 transitions. [2018-11-23 13:50:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:50:55,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:55,783 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:55,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 70 states and 111 transitions. [2018-11-23 13:50:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 111 transitions. [2018-11-23 13:50:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:50:56,444 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:56,444 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:56,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 71 states and 113 transitions. [2018-11-23 13:50:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 113 transitions. [2018-11-23 13:50:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:50:57,099 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:57,099 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:57,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 72 states and 115 transitions. [2018-11-23 13:50:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 115 transitions. [2018-11-23 13:50:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 13:50:57,919 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:57,919 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:58,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 73 states and 117 transitions. [2018-11-23 13:50:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 117 transitions. [2018-11-23 13:50:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:50:58,575 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:58,576 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:58,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:50:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:50:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 74 states and 119 transitions. [2018-11-23 13:50:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 119 transitions. [2018-11-23 13:50:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 13:50:59,270 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:50:59,271 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:50:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:59,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 75 states and 121 transitions. [2018-11-23 13:51:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 121 transitions. [2018-11-23 13:51:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:51:00,176 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:00,177 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:00,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 76 states and 123 transitions. [2018-11-23 13:51:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-11-23 13:51:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 13:51:00,995 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:00,996 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:01,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 77 states and 125 transitions. [2018-11-23 13:51:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2018-11-23 13:51:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:51:01,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:01,728 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:01,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 78 states and 127 transitions. [2018-11-23 13:51:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 127 transitions. [2018-11-23 13:51:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 13:51:02,504 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:02,504 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:02,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 79 states and 129 transitions. [2018-11-23 13:51:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 129 transitions. [2018-11-23 13:51:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:51:03,292 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:03,293 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:03,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 80 states and 131 transitions. [2018-11-23 13:51:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions. [2018-11-23 13:51:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 13:51:04,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:04,340 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:04,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 81 states and 133 transitions. [2018-11-23 13:51:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 133 transitions. [2018-11-23 13:51:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:51:05,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:05,395 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:05,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 82 states and 135 transitions. [2018-11-23 13:51:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 135 transitions. [2018-11-23 13:51:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 13:51:06,316 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:06,317 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:06,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 83 states and 137 transitions. [2018-11-23 13:51:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 137 transitions. [2018-11-23 13:51:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:51:07,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:07,452 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:07,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 84 states and 139 transitions. [2018-11-23 13:51:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 139 transitions. [2018-11-23 13:51:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 13:51:08,578 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:08,579 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:08,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 85 states and 141 transitions. [2018-11-23 13:51:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 141 transitions. [2018-11-23 13:51:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:51:09,535 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:09,535 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:09,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 86 states and 143 transitions. [2018-11-23 13:51:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 143 transitions. [2018-11-23 13:51:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 13:51:10,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:10,423 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:10,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 87 states and 145 transitions. [2018-11-23 13:51:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 145 transitions. [2018-11-23 13:51:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 13:51:11,365 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:11,366 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:11,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 88 states and 147 transitions. [2018-11-23 13:51:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 147 transitions. [2018-11-23 13:51:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 13:51:12,354 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:12,355 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:12,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 13:51:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 89 states and 149 transitions. [2018-11-23 13:51:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 149 transitions. [2018-11-23 13:51:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:51:13,479 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:13,479 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:51:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:13,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:51:13,739 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:51:13,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:51:13,741 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 13:51:13,771 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:51:13,771 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:51:13,772 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 13:51:13,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:51:13,782 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 13:51:13,784 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:51:13,785 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 9 [2018-11-23 13:51:13,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:51:13,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:51:13,790 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 13:51:13,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:51:13,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2018-11-23 13:51:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2018-11-23 13:51:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 14 states and 13 transitions. [2018-11-23 13:51:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 13:51:20,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:51:20,369 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 66 iterations. [2018-11-23 13:51:20,375 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 13:51:20,460 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 13:51:20,466 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 13:51:20,466 INFO L579 CodeCheckObserver]: Invariant with dag size 12 [2018-11-23 13:51:20,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,469 INFO L579 CodeCheckObserver]: Invariant with dag size 9 [2018-11-23 13:51:20,470 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 13:51:20,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:51:20 ImpRootNode [2018-11-23 13:51:20,470 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:51:20,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:51:20,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:51:20,471 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:51:20,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:08" (3/4) ... [2018-11-23 13:51:20,476 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:51:20,485 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2018-11-23 13:51:20,485 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:51:20,509 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~Pluszero~LONGDOUBLE() [2018-11-23 13:51:20,510 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_q#valueAsBitvector_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0]) && v_q#valueAsBitvector_3[63:32] == msw) [2018-11-23 13:51:20,536 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_200e0acc-e1bf-412c-8ad9-421e251b5088/bin-2019/ukojak/witness.graphml [2018-11-23 13:51:20,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:51:20,537 INFO L168 Benchmark]: Toolchain (without parser) took 77256.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 942.5 MB in the beginning and 868.8 MB in the end (delta: 73.7 MB). Peak memory consumption was 373.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:20,538 INFO L168 Benchmark]: CDTParser took 0.12 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 13:51:20,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.61 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 926.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:20,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 926.4 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:20,538 INFO L168 Benchmark]: Boogie Preprocessor took 30.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:20,539 INFO L168 Benchmark]: RCFGBuilder took 4477.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:20,539 INFO L168 Benchmark]: CodeCheck took 72368.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 868.8 MB in the end (delta: 168.3 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:20,539 INFO L168 Benchmark]: Witness Printer took 65.63 ms. Allocated memory is still 1.3 GB. Free memory is still 868.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:51:20,541 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, 53 locations, 1 error locations. SAFE Result, 72.2s OverallTime, 66 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 28 SDslu, 8 SDs, 0 SdLazy, -90 SolverSat, -122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1242.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27724 GetRequests, 27418 SyntacticMatches, 14 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 34278 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2834 NumberOfCodeBlocks, 2834 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 2769 ConstructedInterpolants, 18 QuantifiedInterpolants, 525711 SizeOfPredicates, 95 NumberOfNonLiveVariables, 13718 ConjunctsInSsa, 944 ConjunctsInUnsatCore, 65 InterpolantComputations, 12 PerfectInterpolantSequences, 8703/15931 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: 154]: 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: 19]: Loop Invariant Derived loop invariant: \result == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant [2018-11-23 13:51:20,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 13:51:20,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0]) && v_q#valueAsBitvector_3[63:32] == msw) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 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 242.61 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 926.4 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 68.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 926.4 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4477.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * CodeCheck took 72368.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 868.8 MB in the end (delta: 168.3 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.63 ms. Allocated memory is still 1.3 GB. Free memory is still 868.8 MB. There was no memory consumed. 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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] RESULT: Ultimate proved your program to be correct! Received shutdown request...