./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton_false-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_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/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 66b71342bd068aaa5aa0847a6efcac54b98c09c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/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 66b71342bd068aaa5aa0847a6efcac54b98c09c9 ............................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Solver said unknown --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:21:06,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:21:06,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:21:06,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:21:06,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:21:06,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:21:06,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:21:06,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:21:06,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:21:06,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:21:06,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:21:06,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:21:06,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:21:06,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:21:06,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:21:06,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:21:06,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:21:06,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:21:06,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:21:06,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:21:06,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:21:06,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:21:06,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:21:06,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:21:06,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:21:06,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:21:06,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:21:06,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:21:06,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:21:06,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:21:06,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:21:06,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:21:06,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:21:06,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:21:06,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:21:06,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:21:06,474 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 01:21:06,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:21:06,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:21:06,485 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:21:06,486 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:21:06,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:21:06,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:21:06,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:21:06,486 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:21:06,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:21:06,488 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:21:06,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:21:06,488 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:21:06,488 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:21:06,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:21:06,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:21:06,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:21:06,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:21:06,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:21:06,489 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:21:06,489 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 01:21:06,489 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:21:06,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:21:06,489 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_8cc846f3-96f4-4927-8d6d-4afd455ad813/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 -> 66b71342bd068aaa5aa0847a6efcac54b98c09c9 [2018-11-23 01:21:06,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:21:06,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:21:06,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:21:06,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:21:06,526 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:21:06,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/inv_Newton_false-unreach-call.c [2018-11-23 01:21:06,569 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/241a126de/7db0808a4cd346b38b4465db5d29b9b7/FLAG8de3f9810 [2018-11-23 01:21:06,974 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:21:06,974 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/sv-benchmarks/c/float-benchs/inv_Newton_false-unreach-call.c [2018-11-23 01:21:06,978 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/241a126de/7db0808a4cd346b38b4465db5d29b9b7/FLAG8de3f9810 [2018-11-23 01:21:06,988 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/241a126de/7db0808a4cd346b38b4465db5d29b9b7 [2018-11-23 01:21:06,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:21:06,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:21:06,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:21:06,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:21:06,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:21:06,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:06" (1/1) ... [2018-11-23 01:21:06,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:06, skipping insertion in model container [2018-11-23 01:21:06,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:06" (1/1) ... [2018-11-23 01:21:07,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:21:07,016 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:21:07,123 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:21:07,126 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:21:07,140 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:21:07,152 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:21:07,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07 WrapperNode [2018-11-23 01:21:07,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:21:07,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:21:07,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:21:07,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:21:07,158 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:21:07" (1/1) ... [2018-11-23 01:21:07,164 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:21:07" (1/1) ... [2018-11-23 01:21:07,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:21:07,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:21:07,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:21:07,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:21:07,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:21:07,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:21:07,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:21:07,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:21:07,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/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 01:21:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 01:21:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:21:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 01:21:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:21:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:21:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:21:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:21:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:21:07,436 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:21:07,436 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 01:21:07,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:07 BoogieIcfgContainer [2018-11-23 01:21:07,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:21:07,437 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:21:07,437 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:21:07,444 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:21:07,444 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:07" (1/1) ... [2018-11-23 01:21:07,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:21:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:21:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 01:21:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 01:21:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 01:21:07,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:21:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:21:07,603 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 01:21:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:21:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 8 states and 10 transitions. [2018-11-23 01:21:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-11-23 01:21:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 01:21:07,633 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:21:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:21:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:21:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:21:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:21:07,717 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet4;havoc main_#t~nondet4;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0);inv_#in~A := main_~a~0;havoc inv_#res;havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0.base, inv_~#A_u~0.offset, inv_~#xi_u~0.base, inv_~#xi_u~0.offset;inv_~A := inv_#in~A;havoc inv_~xi~0;havoc inv_~xsi~0;havoc inv_~temp~0;havoc inv_~cond~0;havoc inv_~exp~0;call inv_~#A_u~0.base, inv_~#A_u~0.offset := #Ultimate.alloc(8);call inv_~#xi_u~0.base, inv_~#xi_u~0.offset := #Ultimate.alloc(8);call write~real(inv_~A, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8);call inv_#t~mem0 := read~int(inv_~#A_u~0.base, inv_~#A_u~0.offset, 4);inv_~exp~0 := ~bitwiseAnd(inv_#t~mem0, 2146435072) / 1048576 - 1023;call write~real(inv_#t~union1, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8);havoc inv_#t~union1;havoc inv_#t~mem0;call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8);call write~int(1048576 * (1023 - inv_~exp~0), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 4);call inv_#t~mem2 := read~real(inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8);inv_~xi~0 := inv_#t~mem2;call write~int(inv_#t~union3, inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 4);havoc inv_#t~union3;havoc inv_#t~mem2;inv_~cond~0 := 1; VAL [ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=1, ULTIMATE.start_inv_~exp~0=(- 1023), ULTIMATE.start_inv_~xi~0=3.0, ULTIMATE.start_main_~a~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_~#A_u~0.base|=2, |ULTIMATE.start_inv_~#A_u~0.offset|=0, |ULTIMATE.start_inv_~#xi_u~0.base|=4, |ULTIMATE.start_inv_~#xi_u~0.offset|=0] [?] assume !!(0 != inv_~cond~0);inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0));inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0);inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0);inv_~xi~0 := inv_~xsi~0; VAL [ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=(- 1023), ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_~#A_u~0.base|=2, |ULTIMATE.start_inv_~#A_u~0.offset|=0, |ULTIMATE.start_inv_~#xi_u~0.base|=4, |ULTIMATE.start_inv_~#xi_u~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(0 != inv_~cond~0);}EndParallelCompositioninv_#res := inv_~xi~0;call ULTIMATE.dealloc(inv_~#A_u~0.base, inv_~#A_u~0.offset);havoc inv_~#A_u~0.base, inv_~#A_u~0.offset;call ULTIMATE.dealloc(inv_~#xi_u~0.base, inv_~#xi_u~0.offset);havoc inv_~#xi_u~0.base, inv_~#xi_u~0.offset;main_#t~ret5 := inv_#res;main_~r~0 := main_#t~ret5;havoc main_#t~ret5;__VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=(- 1023), ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, ULTIMATE.start_main_~r~0=4.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_#res|=4.0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=(- 1023), ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, ULTIMATE.start_main_~r~0=4.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_#res|=4.0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=(- 1023), ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, ULTIMATE.start_main_~r~0=4.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_#res|=4.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L48] havoc main_~a~0; [L48] havoc main_~r~0; [L50] main_~a~0 := main_#t~nondet4; [L50] havoc main_#t~nondet4; [L51] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L53] inv_#in~A := main_~a~0; [L53] havoc inv_#res; [L53] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0.base, inv_~#A_u~0.offset, inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L26-L44] inv_~A := inv_#in~A; [L28] havoc inv_~xi~0; [L28] havoc inv_~xsi~0; [L28] havoc inv_~temp~0; [L29] havoc inv_~cond~0; [L29] havoc inv_~exp~0; [L30] call inv_~#A_u~0.base, inv_~#A_u~0.offset := #Ultimate.alloc(8); [L30] call inv_~#xi_u~0.base, inv_~#xi_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(inv_~A, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L32] call inv_#t~mem0 := read~int(inv_~#A_u~0.base, inv_~#A_u~0.offset, 4); [L32] inv_~exp~0 := ~bitwiseAnd(inv_#t~mem0, 2146435072) / 1048576 - 1023; [L32] call write~real(inv_#t~union1, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L32] havoc inv_#t~union1; [L32] havoc inv_#t~mem0; [L33] call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L34] call write~int(1048576 * (1023 - inv_~exp~0), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 4); [L35] call inv_#t~mem2 := read~real(inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L35] inv_~xi~0 := inv_#t~mem2; [L35] call write~int(inv_#t~union3, inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 4); [L35] havoc inv_#t~union3; [L35] havoc inv_#t~mem2; [L36] inv_~cond~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=-1023, inv_~xi~0=3.0, main_~a~0=1.0] [L37-L42] assume !!(0 != inv_~cond~0); [L38] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L39] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L40] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L41] inv_~xi~0 := inv_~xsi~0; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L37-L42] assume !(0 != inv_~cond~0); [L43] inv_#res := inv_~xi~0; [L30] call ULTIMATE.dealloc(inv_~#A_u~0.base, inv_~#A_u~0.offset); [L43] havoc inv_~#A_u~0.base, inv_~#A_u~0.offset; [L30] call ULTIMATE.dealloc(inv_~#xi_u~0.base, inv_~#xi_u~0.offset); [L43] havoc inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L53] main_#t~ret5 := inv_#res; [L53] main_~r~0 := main_#t~ret5; [L53] havoc main_#t~ret5; [L55] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L55] havoc __VERIFIER_assert_~cond; [L18] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L48] havoc main_~a~0; [L48] havoc main_~r~0; [L50] main_~a~0 := main_#t~nondet4; [L50] havoc main_#t~nondet4; [L51] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L53] inv_#in~A := main_~a~0; [L53] havoc inv_#res; [L53] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0.base, inv_~#A_u~0.offset, inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L26-L44] inv_~A := inv_#in~A; [L28] havoc inv_~xi~0; [L28] havoc inv_~xsi~0; [L28] havoc inv_~temp~0; [L29] havoc inv_~cond~0; [L29] havoc inv_~exp~0; [L30] call inv_~#A_u~0.base, inv_~#A_u~0.offset := #Ultimate.alloc(8); [L30] call inv_~#xi_u~0.base, inv_~#xi_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(inv_~A, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L32] call inv_#t~mem0 := read~int(inv_~#A_u~0.base, inv_~#A_u~0.offset, 4); [L32] inv_~exp~0 := ~bitwiseAnd(inv_#t~mem0, 2146435072) / 1048576 - 1023; [L32] call write~real(inv_#t~union1, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L32] havoc inv_#t~union1; [L32] havoc inv_#t~mem0; [L33] call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L34] call write~int(1048576 * (1023 - inv_~exp~0), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 4); [L35] call inv_#t~mem2 := read~real(inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L35] inv_~xi~0 := inv_#t~mem2; [L35] call write~int(inv_#t~union3, inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 4); [L35] havoc inv_#t~union3; [L35] havoc inv_#t~mem2; [L36] inv_~cond~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=-1023, inv_~xi~0=3.0, main_~a~0=1.0] [L37-L42] assume !!(0 != inv_~cond~0); [L38] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L39] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L40] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L41] inv_~xi~0 := inv_~xsi~0; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L37-L42] assume !(0 != inv_~cond~0); [L43] inv_#res := inv_~xi~0; [L30] call ULTIMATE.dealloc(inv_~#A_u~0.base, inv_~#A_u~0.offset); [L43] havoc inv_~#A_u~0.base, inv_~#A_u~0.offset; [L30] call ULTIMATE.dealloc(inv_~#xi_u~0.base, inv_~#xi_u~0.offset); [L43] havoc inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L53] main_#t~ret5 := inv_#res; [L53] main_~r~0 := main_#t~ret5; [L53] havoc main_#t~ret5; [L55] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L55] havoc __VERIFIER_assert_~cond; [L18] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L48] havoc main_~a~0; [L48] havoc main_~r~0; [L50] main_~a~0 := main_#t~nondet4; [L50] havoc main_#t~nondet4; [L51] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L53] inv_#in~A := main_~a~0; [L53] havoc inv_#res; [L53] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0, inv_~#xi_u~0; [L26-L44] inv_~A := inv_#in~A; [L28] havoc inv_~xi~0; [L28] havoc inv_~xsi~0; [L28] havoc inv_~temp~0; [L29] havoc inv_~cond~0; [L29] havoc inv_~exp~0; [L30] FCALL call inv_~#A_u~0 := #Ultimate.alloc(8); [L30] FCALL call inv_~#xi_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(inv_~A, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L32] FCALL call inv_#t~mem0 := read~int({ base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 4); [L32] inv_~exp~0 := ~bitwiseAnd(inv_#t~mem0, 2146435072) / 1048576 - 1023; [L32] FCALL call write~real(inv_#t~union1, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L32] havoc inv_#t~union1; [L32] havoc inv_#t~mem0; [L33] FCALL call write~real(~convertINTToDOUBLE(1), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L34] FCALL call write~int(1048576 * (1023 - inv_~exp~0), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 4); [L35] FCALL call inv_#t~mem2 := read~real({ base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L35] inv_~xi~0 := inv_#t~mem2; [L35] FCALL call write~int(inv_#t~union3, { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 4); [L35] havoc inv_#t~union3; [L35] havoc inv_#t~mem2; [L36] inv_~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=-1023, inv_~xi~0=3.0, main_~a~0=1.0] [L37-L42] COND FALSE !(!(0 != inv_~cond~0)) [L38] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L39] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L40] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L41] inv_~xi~0 := inv_~xsi~0; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L37-L42] COND TRUE !(0 != inv_~cond~0) [L43] inv_#res := inv_~xi~0; [L30] FCALL call ULTIMATE.dealloc(inv_~#A_u~0); [L43] havoc inv_~#A_u~0; [L30] FCALL call ULTIMATE.dealloc(inv_~#xi_u~0); [L43] havoc inv_~#xi_u~0; [L53] main_#t~ret5 := inv_#res; [L53] main_~r~0 := main_#t~ret5; [L53] havoc main_#t~ret5; [L55] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L55] havoc __VERIFIER_assert_~cond; [L18] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L48] havoc main_~a~0; [L48] havoc main_~r~0; [L50] main_~a~0 := main_#t~nondet4; [L50] havoc main_#t~nondet4; [L51] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L53] inv_#in~A := main_~a~0; [L53] havoc inv_#res; [L53] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0, inv_~#xi_u~0; [L26-L44] inv_~A := inv_#in~A; [L28] havoc inv_~xi~0; [L28] havoc inv_~xsi~0; [L28] havoc inv_~temp~0; [L29] havoc inv_~cond~0; [L29] havoc inv_~exp~0; [L30] FCALL call inv_~#A_u~0 := #Ultimate.alloc(8); [L30] FCALL call inv_~#xi_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(inv_~A, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L32] FCALL call inv_#t~mem0 := read~int({ base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 4); [L32] inv_~exp~0 := ~bitwiseAnd(inv_#t~mem0, 2146435072) / 1048576 - 1023; [L32] FCALL call write~real(inv_#t~union1, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L32] havoc inv_#t~union1; [L32] havoc inv_#t~mem0; [L33] FCALL call write~real(~convertINTToDOUBLE(1), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L34] FCALL call write~int(1048576 * (1023 - inv_~exp~0), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 4); [L35] FCALL call inv_#t~mem2 := read~real({ base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L35] inv_~xi~0 := inv_#t~mem2; [L35] FCALL call write~int(inv_#t~union3, { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 4); [L35] havoc inv_#t~union3; [L35] havoc inv_#t~mem2; [L36] inv_~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=-1023, inv_~xi~0=3.0, main_~a~0=1.0] [L37-L42] COND FALSE !(!(0 != inv_~cond~0)) [L38] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L39] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L40] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L41] inv_~xi~0 := inv_~xsi~0; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L37-L42] COND TRUE !(0 != inv_~cond~0) [L43] inv_#res := inv_~xi~0; [L30] FCALL call ULTIMATE.dealloc(inv_~#A_u~0); [L43] havoc inv_~#A_u~0; [L30] FCALL call ULTIMATE.dealloc(inv_~#xi_u~0); [L43] havoc inv_~#xi_u~0; [L53] main_#t~ret5 := inv_#res; [L53] main_~r~0 := main_#t~ret5; [L53] havoc main_#t~ret5; [L55] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L55] havoc __VERIFIER_assert_~cond; [L18] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L18] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=-1023, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L48] havoc ~a~0; [L48] havoc ~r~0; [L50] ~a~0 := #t~nondet4; [L50] havoc #t~nondet4; [L51] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); [L26-L44] ~A := #in~A; [L28] havoc ~xi~0; [L28] havoc ~xsi~0; [L28] havoc ~temp~0; [L29] havoc ~cond~0; [L29] havoc ~exp~0; [L30] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L30] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 4); [L32] ~exp~0 := ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 - 1023; [L32] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L34] FCALL call write~int(1048576 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 4); [L35] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L35] ~xi~0 := #t~mem2; [L35] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 4); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] ~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0] [L37-L42] COND FALSE !(!(0 != ~cond~0)) [L38] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L39] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L40] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L41] ~xi~0 := ~xsi~0; VAL [#NULL!base=0, #NULL!offset=0] [L37-L42] COND TRUE !(0 != ~cond~0) [L43] #res := ~xi~0; [L30] FCALL call ULTIMATE.dealloc(~#A_u~0); [L43] havoc ~#A_u~0; [L30] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L43] havoc ~#xi_u~0; [L53] ~r~0 := #t~ret5; [L53] havoc #t~ret5; [L18] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L18] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L18] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L48] havoc ~a~0; [L48] havoc ~r~0; [L50] ~a~0 := #t~nondet4; [L50] havoc #t~nondet4; [L51] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); [L26-L44] ~A := #in~A; [L28] havoc ~xi~0; [L28] havoc ~xsi~0; [L28] havoc ~temp~0; [L29] havoc ~cond~0; [L29] havoc ~exp~0; [L30] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L30] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 4); [L32] ~exp~0 := ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 - 1023; [L32] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L34] FCALL call write~int(1048576 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 4); [L35] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L35] ~xi~0 := #t~mem2; [L35] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 4); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] ~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0] [L37-L42] COND FALSE !(!(0 != ~cond~0)) [L38] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L39] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L40] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L41] ~xi~0 := ~xsi~0; VAL [#NULL!base=0, #NULL!offset=0] [L37-L42] COND TRUE !(0 != ~cond~0) [L43] #res := ~xi~0; [L30] FCALL call ULTIMATE.dealloc(~#A_u~0); [L43] havoc ~#A_u~0; [L30] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L43] havoc ~#xi_u~0; [L53] ~r~0 := #t~ret5; [L53] havoc #t~ret5; [L18] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L18] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L18] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L48] double a,r; [L50] a = __VERIFIER_nondet_double() [L28] double xi, xsi, temp; [L29] signed int cond, exp; [L30] union double_int A_u, xi_u; [L31] A_u.d = A [L32] EXPR A_u.i [L32] exp = (signed int) ((A_u.i & 0x7FF00000) >> 20) - 1023 [L33] xi_u.d = 1 [L34] xi_u.i = ((1023-exp) << 20) [L35] EXPR xi_u.d [L35] xi = xi_u.d [L36] cond = 1 [L37] COND TRUE \read(cond) [L38] xsi = 2*xi-A*xi*xi [L39] temp = xsi-xi [L40] cond = ((temp > 1e-10) || (temp < -1e-10)) [L41] xi = xsi [L37] COND FALSE !(\read(cond)) [L43] return xi; [L43] return xi; [L43] return xi; [L53] r = inv(a) [L18] COND TRUE !(cond) [L18] __VERIFIER_error() ----- [2018-11-23 01:21:07,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:21:07 ImpRootNode [2018-11-23 01:21:07,753 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:21:07,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:21:07,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:21:07,754 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:21:07,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:07" (3/4) ... [2018-11-23 01:21:07,758 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:21:07,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:21:07,758 INFO L168 Benchmark]: Toolchain (without parser) took 767.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:07,760 INFO L168 Benchmark]: CDTParser took 0.15 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 01:21:07,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.15 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:07,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.87 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:21:07,762 INFO L168 Benchmark]: Boogie Preprocessor took 53.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:07,762 INFO L168 Benchmark]: RCFGBuilder took 208.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:07,763 INFO L168 Benchmark]: CodeCheck took 316.23 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:07,764 INFO L168 Benchmark]: Witness Printer took 4.11 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 01:21:07,767 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, 12 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 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, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 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: 18]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of to_real at line 33. Possible FailurePath: [L48] double a,r; [L50] a = __VERIFIER_nondet_double() [L28] double xi, xsi, temp; [L29] signed int cond, exp; [L30] union double_int A_u, xi_u; [L31] A_u.d = A [L32] EXPR A_u.i [L32] exp = (signed int) ((A_u.i & 0x7FF00000) >> 20) - 1023 [L33] xi_u.d = 1 [L34] xi_u.i = ((1023-exp) << 20) [L35] EXPR xi_u.d [L35] xi = xi_u.d [L36] cond = 1 [L37] COND TRUE \read(cond) [L38] xsi = 2*xi-A*xi*xi [L39] temp = xsi-xi [L40] cond = ((temp > 1e-10) || (temp < -1e-10)) [L41] xi = xsi [L37] COND FALSE !(\read(cond)) [L43] return xi; [L43] return xi; [L43] return xi; [L53] r = inv(a) [L18] COND TRUE !(cond) [L18] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 161.15 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.87 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * CodeCheck took 316.23 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 01:21:09,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:21:09,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:21:09,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:21:09,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:21:09,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:21:09,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:21:09,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:21:09,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:21:09,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:21:09,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:21:09,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:21:09,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:21:09,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:21:09,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:21:09,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:21:09,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:21:09,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:21:09,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:21:09,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:21:09,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:21:09,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:21:09,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:21:09,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:21:09,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:21:09,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:21:09,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:21:09,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:21:09,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:21:09,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:21:09,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:21:09,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:21:09,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:21:09,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:21:09,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:21:09,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:21:09,224 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 01:21:09,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:21:09,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:21:09,236 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:21:09,236 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:21:09,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:21:09,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:21:09,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:21:09,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:21:09,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:21:09,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:21:09,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:21:09,238 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:21:09,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:21:09,239 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:21:09,239 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:21:09,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:21:09,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:21:09,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:21:09,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:21:09,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:21:09,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:21:09,240 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 01:21:09,240 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:21:09,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:21:09,241 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:21:09,241 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:21:09,241 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_8cc846f3-96f4-4927-8d6d-4afd455ad813/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 -> 66b71342bd068aaa5aa0847a6efcac54b98c09c9 [2018-11-23 01:21:09,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:21:09,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:21:09,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:21:09,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:21:09,288 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:21:09,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/inv_Newton_false-unreach-call.c [2018-11-23 01:21:09,329 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/34f93eab0/cbaac84b178e4c8ea555e85741ca3bcd/FLAG460f918b2 [2018-11-23 01:21:09,667 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:21:09,667 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/sv-benchmarks/c/float-benchs/inv_Newton_false-unreach-call.c [2018-11-23 01:21:09,671 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/34f93eab0/cbaac84b178e4c8ea555e85741ca3bcd/FLAG460f918b2 [2018-11-23 01:21:10,096 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/bin-2019/ukojak/data/34f93eab0/cbaac84b178e4c8ea555e85741ca3bcd [2018-11-23 01:21:10,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:21:10,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:21:10,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:21:10,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:21:10,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:21:10,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10, skipping insertion in model container [2018-11-23 01:21:10,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:21:10,127 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:21:10,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:21:10,266 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:21:10,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:21:10,305 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:21:10,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10 WrapperNode [2018-11-23 01:21:10,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:21:10,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:21:10,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:21:10,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:21:10,311 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:21:10" (1/1) ... [2018-11-23 01:21:10,318 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:21:10" (1/1) ... [2018-11-23 01:21:10,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:21:10,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:21:10,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:21:10,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:21:10,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... [2018-11-23 01:21:10,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:21:10,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:21:10,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:21:10,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:21:10,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cc846f3-96f4-4927-8d6d-4afd455ad813/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 01:21:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 01:21:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 01:21:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:21:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:21:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:21:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:21:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:21:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:21:10,551 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 01:21:12,085 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:21:12,085 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 01:21:12,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:12 BoogieIcfgContainer [2018-11-23 01:21:12,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:21:12,086 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:21:12,086 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:21:12,095 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:21:12,095 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:12" (1/1) ... [2018-11-23 01:21:12,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:21:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:21:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 01:21:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 01:21:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 01:21:12,134 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:21:12,168 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:21:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:21:12,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:21:12,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 01:21:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:21:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 8 states and 10 transitions. [2018-11-23 01:21:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-11-23 01:21:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 01:21:53,578 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:21:53,579 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:22:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 01:22:03,955 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: Solver said unknown at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:505) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 01:22:03,958 INFO L168 Benchmark]: Toolchain (without parser) took 53858.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:22:03,959 INFO L168 Benchmark]: CDTParser took 0.15 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 01:22:03,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:22:03,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.49 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:22:03,960 INFO L168 Benchmark]: Boogie Preprocessor took 23.34 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:22:03,961 INFO L168 Benchmark]: RCFGBuilder took 1727.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:22:03,962 INFO L168 Benchmark]: CodeCheck took 51871.13 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:22:03,964 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: Solver said unknown de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: Solver said unknown: de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:505) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 204.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 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 28.49 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.34 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1727.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * CodeCheck took 51871.13 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...