./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i --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_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 349f3b147b258ab226d6875b5690ba51bba86051 ................................................................................................................................................................................. 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_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 349f3b147b258ab226d6875b5690ba51bba86051 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:53:16,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:53:16,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:53:16,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:53:16,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:53:16,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:53:16,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:53:16,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:53:16,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:53:16,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:53:16,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:53:16,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:53:16,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:53:16,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:53:16,947 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:53:16,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:53:16,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:53:16,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:53:16,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:53:16,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:53:16,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:53:16,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:53:16,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:53:16,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:53:16,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:53:16,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:53:16,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:53:16,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:53:16,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:53:16,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:53:16,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:53:16,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:53:16,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:53:16,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:53:16,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:53:16,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:53:16,961 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:53:16,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:53:16,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:53:16,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:53:16,969 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:53:16,970 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:53:16,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:53:16,970 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:53:16,970 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:53:16,970 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:53:16,970 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:53:16,970 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:53:16,971 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:53:16,971 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:53:16,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:53:16,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:53:16,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:53:16,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:53:16,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:53:16,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:53:16,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:53:16,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:53:16,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:53:16,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:53:16,973 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:53:16,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:53:16,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:53:16,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:53:16,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:53:16,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:53:16,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:53:16,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:53:16,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:53:16,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:53:16,974 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:53:16,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:53:16,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:53:16,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:53:16,975 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan 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 -> Taipan 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 -> 349f3b147b258ab226d6875b5690ba51bba86051 [2018-11-23 14:53:16,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:53:17,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:53:17,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:53:17,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:53:17,012 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:53:17,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i [2018-11-23 14:53:17,057 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/f99352681/03d39a604df94095a2cfd124ea7fd152/FLAGa3528efd6 [2018-11-23 14:53:17,494 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:53:17,494 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i [2018-11-23 14:53:17,503 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/f99352681/03d39a604df94095a2cfd124ea7fd152/FLAGa3528efd6 [2018-11-23 14:53:17,515 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/f99352681/03d39a604df94095a2cfd124ea7fd152 [2018-11-23 14:53:17,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:53:17,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:53:17,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:53:17,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:53:17,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:53:17,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:17" (1/1) ... [2018-11-23 14:53:17,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346a68e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:17, skipping insertion in model container [2018-11-23 14:53:17,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:17" (1/1) ... [2018-11-23 14:53:17,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:53:17,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:53:17,833 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:825) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:1318) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$40(StandardFunctionHandler.java:320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1310) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.dispatchDecaySwitchToRValueFunctionArgument(ExpressionResultTransformer.java:113) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleFloatBuiltinIsUnordered(StandardFunctionHandler.java:1409) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1310) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.dispatchDecaySwitchToRValueFunctionArgument(ExpressionResultTransformer.java:113) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:678) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:508) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1317) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1261) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:962) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1332) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3436) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2231) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:538) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:190) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) 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 14:53:17,835 INFO L168 Benchmark]: Toolchain (without parser) took 317.08 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:53:17,836 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:53:17,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.50 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:53:17,838 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.50 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.4 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:825) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 14:53:19,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:53:19,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:53:19,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:53:19,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:53:19,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:53:19,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:53:19,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:53:19,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:53:19,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:53:19,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:53:19,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:53:19,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:53:19,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:53:19,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:53:19,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:53:19,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:53:19,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:53:19,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:53:19,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:53:19,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:53:19,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:53:19,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:53:19,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:53:19,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:53:19,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:53:19,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:53:19,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:53:19,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:53:19,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:53:19,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:53:19,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:53:19,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:53:19,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:53:19,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:53:19,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:53:19,072 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 14:53:19,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:53:19,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:53:19,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:53:19,083 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:53:19,084 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:53:19,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:53:19,084 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:53:19,084 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:53:19,084 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:53:19,084 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:53:19,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:53:19,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:53:19,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:53:19,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:53:19,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:53:19,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:53:19,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:53:19,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:53:19,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:53:19,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:53:19,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:53:19,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:53:19,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:53:19,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:53:19,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:53:19,088 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 14:53:19,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:53:19,088 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:53:19,088 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:53:19,088 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_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan 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 -> Taipan 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 -> 349f3b147b258ab226d6875b5690ba51bba86051 [2018-11-23 14:53:19,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:53:19,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:53:19,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:53:19,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:53:19,127 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:53:19,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i [2018-11-23 14:53:19,163 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/3f734b96c/f6bb8c8df54c4d88add91155f4e7e25c/FLAGedd67296c [2018-11-23 14:53:19,605 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:53:19,605 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/sv-benchmarks/c/floats-esbmc-regression/isunordered_true-unreach-call.i [2018-11-23 14:53:19,616 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/3f734b96c/f6bb8c8df54c4d88add91155f4e7e25c/FLAGedd67296c [2018-11-23 14:53:19,625 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/data/3f734b96c/f6bb8c8df54c4d88add91155f4e7e25c [2018-11-23 14:53:19,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:53:19,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:53:19,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:53:19,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:53:19,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:53:19,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:19" (1/1) ... [2018-11-23 14:53:19,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ace17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:19, skipping insertion in model container [2018-11-23 14:53:19,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:19" (1/1) ... [2018-11-23 14:53:19,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:53:19,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:53:20,015 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:53:20,018 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:53:20,041 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:53:20,217 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:53:20,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20 WrapperNode [2018-11-23 14:53:20,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:53:20,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:53:20,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:53:20,219 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:53:20,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:53:20,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:53:20,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:53:20,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:53:20,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... [2018-11-23 14:53:20,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:53:20,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:53:20,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:53:20,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:53:20,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:53:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 14:53:20,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 14:53:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:53:20,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:53:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:53:20,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:53:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:53:20,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:53:20,463 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:53:20,463 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 14:53:20,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:20 BoogieIcfgContainer [2018-11-23 14:53:20,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:53:20,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:53:20,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:53:20,466 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:53:20,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:53:19" (1/3) ... [2018-11-23 14:53:20,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f5010b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:53:20, skipping insertion in model container [2018-11-23 14:53:20,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:20" (2/3) ... [2018-11-23 14:53:20,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f5010b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:53:20, skipping insertion in model container [2018-11-23 14:53:20,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:20" (3/3) ... [2018-11-23 14:53:20,469 INFO L112 eAbstractionObserver]: Analyzing ICFG isunordered_true-unreach-call.i [2018-11-23 14:53:20,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:53:20,481 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:53:20,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:53:20,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:53:20,508 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:53:20,508 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:53:20,508 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:53:20,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:53:20,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:53:20,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:53:20,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:53:20,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:53:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 14:53:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:53:20,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:53:20,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:53:20,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:53:20,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:53:20,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1083661312, now seen corresponding path program 1 times [2018-11-23 14:53:20,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:53:20,533 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:53:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:53:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:53:20,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:53:20,614 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 14:53:20,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:53:20,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:53:20,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:53:20,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:53:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:53:20,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:53:20,634 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2018-11-23 14:53:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:53:20,701 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 14:53:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:53:20,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-23 14:53:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:53:20,708 INFO L225 Difference]: With dead ends: 37 [2018-11-23 14:53:20,708 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 14:53:20,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:53:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 14:53:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 14:53:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 14:53:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 14:53:20,734 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2018-11-23 14:53:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:53:20,735 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 14:53:20,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:53:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 14:53:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:53:20,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:53:20,737 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:53:20,737 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:53:20,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:53:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -466517877, now seen corresponding path program 1 times [2018-11-23 14:53:20,737 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:53:20,738 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:53:20,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:53:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:53:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:53:20,802 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #22#return; [?] CALL call #t~ret84 := main(); [?] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #26#return; [?] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #28#return; [?] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #30#return; [?] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L871] CALL __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), 1.0)) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L871] RET __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), 1.0)) [L872] CALL __VERIFIER_assert(__builtin_isunordered(1.0, (__builtin_nanf ("")))) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L872] RET __VERIFIER_assert(__builtin_isunordered(1.0, (__builtin_nanf ("")))) [L873] CALL __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), (__builtin_nanf ("")))) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L873] RET __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), (__builtin_nanf ("")))) [L874] CALL __VERIFIER_assert(!__builtin_isunordered(1.0, 0.0)) VAL [\old(cond)=0] [L867] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L867] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 14:53:20,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:53:20 BoogieIcfgContainer [2018-11-23 14:53:20,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:53:20,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:53:20,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:53:20,826 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:53:20,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:20" (3/4) ... [2018-11-23 14:53:20,828 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #22#return; [?] CALL call #t~ret84 := main(); [?] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #26#return; [?] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #28#return; [?] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume !(0bv32 == ~cond); VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] assume true; VAL [__VERIFIER_assert_~cond=(_ bv1 32), |__VERIFIER_assert_#in~cond|=(_ bv1 32)] [?] RET #30#return; [?] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] assume !(0bv32 == ~cond); VAL [#in~cond=1bv32, ~cond=1bv32] [L867] ensures true; VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret84 := main(); [L871] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L871] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L872] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L872] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L873] CALL call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); VAL [#in~cond=1bv32] [L867] ~cond := #in~cond; VAL [#in~cond=1bv32, ~cond=1bv32] [L867] COND FALSE !(0bv32 == ~cond) VAL [#in~cond=1bv32, ~cond=1bv32] [L873] RET call __VERIFIER_assert((if ~NaN~DOUBLE() == ~NaN~DOUBLE() || ~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~NaN~FLOAT()) == ~NaN~DOUBLE() then 1bv32 else 0bv32)); [L874] CALL call __VERIFIER_assert((if !(~NaN~DOUBLE() == ~NaN~DOUBLE() || ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0) == ~NaN~DOUBLE()) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L867] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L867] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L867] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L871] CALL __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), 1.0)) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L871] RET __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), 1.0)) [L872] CALL __VERIFIER_assert(__builtin_isunordered(1.0, (__builtin_nanf ("")))) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L872] RET __VERIFIER_assert(__builtin_isunordered(1.0, (__builtin_nanf ("")))) [L873] CALL __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), (__builtin_nanf ("")))) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L873] RET __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), (__builtin_nanf ("")))) [L874] CALL __VERIFIER_assert(!__builtin_isunordered(1.0, 0.0)) VAL [\old(cond)=0] [L867] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L867] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 14:53:20,862 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9f3f3e3e-6116-4f2b-b661-f10b819fb3a4/bin-2019/utaipan/witness.graphml [2018-11-23 14:53:20,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:53:20,863 INFO L168 Benchmark]: Toolchain (without parser) took 1235.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 1.5 kB. Max. memory is 11.5 GB. [2018-11-23 14:53:20,864 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 14:53:20,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 825.7 MB in the end (delta: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:53:20,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.12 ms. Allocated memory is still 1.0 GB. Free memory is still 825.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:53:20,865 INFO L168 Benchmark]: Boogie Preprocessor took 75.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 825.7 MB in the beginning and 1.1 GB in the end (delta: -297.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:53:20,866 INFO L168 Benchmark]: RCFGBuilder took 142.27 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: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:53:20,866 INFO L168 Benchmark]: TraceAbstraction took 361.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:53:20,867 INFO L168 Benchmark]: Witness Printer took 36.68 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 14:53:20,869 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * 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 589.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 825.7 MB in the end (delta: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.12 ms. Allocated memory is still 1.0 GB. Free memory is still 825.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 825.7 MB in the beginning and 1.1 GB in the end (delta: -297.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 142.27 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: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 361.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Witness Printer took 36.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 867]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L871] CALL __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), 1.0)) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L871] RET __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), 1.0)) [L872] CALL __VERIFIER_assert(__builtin_isunordered(1.0, (__builtin_nanf ("")))) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L872] RET __VERIFIER_assert(__builtin_isunordered(1.0, (__builtin_nanf ("")))) [L873] CALL __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), (__builtin_nanf ("")))) VAL [\old(cond)=1] [L867] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L873] RET __VERIFIER_assert(__builtin_isunordered((__builtin_nanf ("")), (__builtin_nanf ("")))) [L874] CALL __VERIFIER_assert(!__builtin_isunordered(1.0, 0.0)) VAL [\old(cond)=0] [L867] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L867] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 4 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 5 SDslu, 28 SDs, 0 SdLazy, 16 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 2 NumberOfNonLiveVariables, 16 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...