./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/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 16ab6efcf7b0c54aabe43554a033bf1907c93094 .................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/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 16ab6efcf7b0c54aabe43554a033bf1907c93094 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:43:59,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:43:59,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:43:59,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:43:59,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:43:59,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:43:59,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:43:59,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:43:59,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:43:59,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:43:59,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:43:59,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:43:59,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:43:59,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:43:59,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:43:59,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:43:59,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:43:59,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:43:59,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:43:59,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:43:59,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:43:59,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:43:59,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:43:59,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:43:59,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:43:59,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:43:59,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:43:59,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:43:59,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:43:59,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:43:59,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:43:59,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:43:59,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:43:59,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:43:59,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:43:59,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:43:59,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:43:59,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:43:59,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:43:59,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:43:59,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:43:59,864 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:43:59,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:43:59,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:43:59,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:43:59,878 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:43:59,878 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:43:59,878 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:43:59,878 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:43:59,878 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:43:59,879 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:43:59,879 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:43:59,879 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:43:59,879 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:43:59,879 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:43:59,880 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:43:59,880 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:43:59,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:43:59,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:43:59,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:43:59,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:43:59,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:43:59,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:43:59,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:43:59,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:43:59,882 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:43:59,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:43:59,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:43:59,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:43:59,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:43:59,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:43:59,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:43:59,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:43:59,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:43:59,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:43:59,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:43:59,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:43:59,884 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:43:59,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:43:59,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:43:59,884 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:43:59,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:43:59,884 INFO L138 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/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/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 -> 16ab6efcf7b0c54aabe43554a033bf1907c93094 [2019-12-07 20:43:59,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:44:00,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:44:00,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:44:00,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:44:00,013 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:44:00,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-12-07 20:44:00,059 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/8cccd0085/c0cdb1de250c4d6f8d0e6b5f55aa1403/FLAGe2cc7ecae [2019-12-07 20:44:00,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:44:00,375 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-12-07 20:44:00,379 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/8cccd0085/c0cdb1de250c4d6f8d0e6b5f55aa1403/FLAGe2cc7ecae [2019-12-07 20:44:00,387 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/8cccd0085/c0cdb1de250c4d6f8d0e6b5f55aa1403 [2019-12-07 20:44:00,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:44:00,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:44:00,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:44:00,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:44:00,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:44:00,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4098f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00, skipping insertion in model container [2019-12-07 20:44:00,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:44:00,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:44:00,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:44:00,550 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:44:00,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:44:00,572 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:44:00,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00 WrapperNode [2019-12-07 20:44:00,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:44:00,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:44:00,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:44:00,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:44:00,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:44:00,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:44:00,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:44:00,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:44:00,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... [2019-12-07 20:44:00,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:44:00,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:44:00,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:44:00,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:44:00,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/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 [2019-12-07 20:44:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:44:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:44:00,763 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:44:00,763 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 20:44:00,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:00 BoogieIcfgContainer [2019-12-07 20:44:00,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:44:00,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:44:00,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:44:00,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:44:00,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:44:00" (1/3) ... [2019-12-07 20:44:00,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e608e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:44:00, skipping insertion in model container [2019-12-07 20:44:00,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:00" (2/3) ... [2019-12-07 20:44:00,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e608e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:44:00, skipping insertion in model container [2019-12-07 20:44:00,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:00" (3/3) ... [2019-12-07 20:44:00,768 INFO L109 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2019-12-07 20:44:00,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:44:00,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:44:00,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:44:00,799 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:44:00,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:44:00,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:44:00,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:44:00,800 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:44:00,800 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:44:00,800 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:44:00,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:44:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-12-07 20:44:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:44:00,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:00,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:00,813 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1602314196, now seen corresponding path program 1 times [2019-12-07 20:44:00,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:00,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286180965] [2019-12-07 20:44:00,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:00,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286180965] [2019-12-07 20:44:00,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:00,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:44:00,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201142523] [2019-12-07 20:44:00,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:44:00,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:44:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:44:00,939 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-12-07 20:44:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:00,976 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-12-07 20:44:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:44:00,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 20:44:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:00,984 INFO L225 Difference]: With dead ends: 21 [2019-12-07 20:44:00,984 INFO L226 Difference]: Without dead ends: 11 [2019-12-07 20:44:00,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:44:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-07 20:44:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-07 20:44:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 20:44:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-12-07 20:44:01,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-12-07 20:44:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:01,008 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-12-07 20:44:01,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:44:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-12-07 20:44:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:44:01,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:01,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:01,009 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1619324857, now seen corresponding path program 1 times [2019-12-07 20:44:01,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:01,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899985759] [2019-12-07 20:44:01,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:44:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:44:01,033 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:44:01,033 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:44:01,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:44:01 BoogieIcfgContainer [2019-12-07 20:44:01,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:44:01,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:44:01,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:44:01,051 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:44:01,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:00" (3/4) ... [2019-12-07 20:44:01,054 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 20:44:01,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:44:01,056 INFO L168 Benchmark]: Toolchain (without parser) took 665.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -111.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:44:01,056 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:44:01,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:01,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:44:01,058 INFO L168 Benchmark]: Boogie Preprocessor took 12.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:44:01,058 INFO L168 Benchmark]: RCFGBuilder took 153.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:01,058 INFO L168 Benchmark]: TraceAbstraction took 286.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:01,059 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:44:01,061 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 286.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 40]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 21. Possible FailurePath: [L1] int __return_main; [L7] int __return_76; [L10] double main__x; [L11] double main__y; [L12] main__x = __VERIFIER_nondet_double() [L13] int main____CPAchecker_TMP_0; VAL [__return_76=0, __return_main=0] [L14] COND TRUE main__x >= 0.0 VAL [__return_76=0, __return_main=0] [L16] COND TRUE main__x <= 10.0 [L18] main____CPAchecker_TMP_0 = 1 VAL [__return_76=0, __return_main=0] [L19] COND TRUE main____CPAchecker_TMP_0 != 0 [L21] main__y = (main__x * main__x) - main__x [L22] COND TRUE main__y >= 0 [L24] main__y = main__x / 10.0 [L26] int main____CPAchecker_TMP_1; VAL [__return_76=0, __return_main=0] [L27] COND FALSE !(main__y >= 0.0) VAL [__return_76=0, __return_main=0] [L53] main____CPAchecker_TMP_1 = 0 VAL [__return_76=0, __return_main=0] [L34] int __tmp_1; [L35] __tmp_1 = main____CPAchecker_TMP_1 [L36] int __VERIFIER_assert__cond; [L37] __VERIFIER_assert__cond = __tmp_1 VAL [__return_76=0, __return_main=0] [L38] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_76=0, __return_main=0] [L40] __VERIFIER_error() VAL [__return_76=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16 SDtfs, 5 SDslu, 25 SDs, 0 SdLazy, 10 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 20:44:02,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:44:02,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:44:02,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:44:02,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:44:02,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:44:02,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:44:02,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:44:02,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:44:02,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:44:02,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:44:02,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:44:02,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:44:02,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:44:02,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:44:02,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:44:02,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:44:02,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:44:02,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:44:02,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:44:02,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:44:02,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:44:02,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:44:02,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:44:02,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:44:02,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:44:02,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:44:02,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:44:02,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:44:02,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:44:02,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:44:02,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:44:02,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:44:02,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:44:02,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:44:02,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:44:02,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:44:02,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:44:02,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:44:02,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:44:02,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:44:02,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 20:44:02,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:44:02,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:44:02,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:44:02,492 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:44:02,492 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:44:02,492 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:44:02,492 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:44:02,492 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:44:02,492 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:44:02,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:44:02,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:44:02,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:44:02,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:44:02,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:44:02,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:44:02,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:44:02,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:44:02,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:44:02,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:44:02,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:44:02,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:44:02,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:44:02,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:44:02,496 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/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 -> 16ab6efcf7b0c54aabe43554a033bf1907c93094 [2019-12-07 20:44:02,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:44:02,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:44:02,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:44:02,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:44:02,683 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:44:02,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-12-07 20:44:02,733 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/8a9ebaac5/86cbec73b26c45b695f16da4338aee13/FLAG0aa5e9fe1 [2019-12-07 20:44:03,120 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:44:03,121 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-12-07 20:44:03,124 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/8a9ebaac5/86cbec73b26c45b695f16da4338aee13/FLAG0aa5e9fe1 [2019-12-07 20:44:03,527 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/data/8a9ebaac5/86cbec73b26c45b695f16da4338aee13 [2019-12-07 20:44:03,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:44:03,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:44:03,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:44:03,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:44:03,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:44:03,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b30e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03, skipping insertion in model container [2019-12-07 20:44:03,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:44:03,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:44:03,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:44:03,669 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:44:03,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:44:03,690 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:44:03,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03 WrapperNode [2019-12-07 20:44:03,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:44:03,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:44:03,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:44:03,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:44:03,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:44:03,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:44:03,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:44:03,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:44:03,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... [2019-12-07 20:44:03,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:44:03,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:44:03,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:44:03,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:44:03,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/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 [2019-12-07 20:44:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:44:03,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:44:07,159 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:44:07,159 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 20:44:07,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:07 BoogieIcfgContainer [2019-12-07 20:44:07,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:44:07,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:44:07,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:44:07,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:44:07,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:44:03" (1/3) ... [2019-12-07 20:44:07,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e4267c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:44:07, skipping insertion in model container [2019-12-07 20:44:07,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:44:03" (2/3) ... [2019-12-07 20:44:07,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e4267c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:44:07, skipping insertion in model container [2019-12-07 20:44:07,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:07" (3/3) ... [2019-12-07 20:44:07,166 INFO L109 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2019-12-07 20:44:07,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:44:07,176 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:44:07,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:44:07,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:44:07,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:44:07,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:44:07,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:44:07,198 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:44:07,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:44:07,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:44:07,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:44:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-12-07 20:44:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:44:07,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:07,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:07,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2019-12-07 20:44:07,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:44:07,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353686977] [2019-12-07 20:44:07,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 20:44:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:07,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:44:07,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:07,589 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:07,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353686977] [2019-12-07 20:44:07,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:07,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:44:07,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712008990] [2019-12-07 20:44:07,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:44:07,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:44:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:44:07,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:44:07,623 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2019-12-07 20:44:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:07,666 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-12-07 20:44:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:44:07,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 20:44:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:07,675 INFO L225 Difference]: With dead ends: 30 [2019-12-07 20:44:07,675 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 20:44:07,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:44:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 20:44:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 20:44:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 20:44:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 20:44:07,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-12-07 20:44:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:07,706 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 20:44:07,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:44:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 20:44:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:44:07,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:07,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:07,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:44:07,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2019-12-07 20:44:07,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:44:07,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812937958] [2019-12-07 20:44:07,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 20:44:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:08,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:44:08,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:19,626 WARN L192 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 15 [2019-12-07 20:44:25,755 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from false [2019-12-07 20:44:27,783 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from true [2019-12-07 20:44:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:40,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:58,718 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 8 [2019-12-07 20:45:01,814 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53))) is different from true [2019-12-07 20:45:03,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)))) is different from false [2019-12-07 20:45:05,892 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)))) is different from true [2019-12-07 20:45:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:05,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812937958] [2019-12-07 20:45:05,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:05,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-12-07 20:45:05,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690441422] [2019-12-07 20:45:05,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:45:05,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:05,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:45:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=35, Unknown=11, NotChecked=42, Total=110 [2019-12-07 20:45:05,898 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2019-12-07 20:45:08,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 20:45:33,038 WARN L192 SmtUtils]: Spent 14.11 s on a formula simplification that was a NOOP. DAG size: 17 [2019-12-07 20:45:49,903 WARN L192 SmtUtils]: Spent 10.53 s on a formula simplification that was a NOOP. DAG size: 15 [2019-12-07 20:45:56,026 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) is different from false [2019-12-07 20:46:01,279 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) is different from false [2019-12-07 20:46:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:46:16,924 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-12-07 20:46:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:46:16,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-12-07 20:46:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:46:16,926 INFO L225 Difference]: With dead ends: 27 [2019-12-07 20:46:16,926 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 20:46:16,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.7s TimeCoverageRelationStatistics Valid=39, Invalid=57, Unknown=18, NotChecked=126, Total=240 [2019-12-07 20:46:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 20:46:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2019-12-07 20:46:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 20:46:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 20:46:16,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-12-07 20:46:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:46:16,932 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 20:46:16,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:46:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-12-07 20:46:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:46:16,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:46:16,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:46:17,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:46:17,134 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:46:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:46:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -125142316, now seen corresponding path program 1 times [2019-12-07 20:46:17,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:46:17,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186989404] [2019-12-07 20:46:17,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 20:46:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:46:17,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:46:17,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:46:20,658 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) c_ULTIMATE.start_main_~main__y~0))) is different from true [2019-12-07 20:46:27,339 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2019-12-07 20:46:29,532 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2019-12-07 20:46:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:46:42,911 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:46:45,155 WARN L860 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))) is different from true [2019-12-07 20:46:51,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53)))) is different from false [2019-12-07 20:46:54,052 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53)))) is different from true [2019-12-07 20:46:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:46:58,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186989404] [2019-12-07 20:46:58,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:46:58,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 20:46:58,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76453246] [2019-12-07 20:46:58,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:46:58,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:46:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:46:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2019-12-07 20:46:58,515 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-12-07 20:47:00,747 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) is different from true [2019-12-07 20:47:13,576 WARN L192 SmtUtils]: Spent 8.78 s on a formula simplification that was a NOOP. DAG size: 13 [2019-12-07 20:47:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:16,185 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-12-07 20:47:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:47:16,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 20:47:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:16,187 INFO L225 Difference]: With dead ends: 21 [2019-12-07 20:47:16,187 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 20:47:16,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=18, Invalid=14, Unknown=8, NotChecked=50, Total=90 [2019-12-07 20:47:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 20:47:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-12-07 20:47:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 20:47:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-12-07 20:47:16,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-12-07 20:47:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:16,192 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-12-07 20:47:16,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:47:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-12-07 20:47:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:47:16,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:16,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:16,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:47:16,394 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash 519293970, now seen corresponding path program 1 times [2019-12-07 20:47:16,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:47:16,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307735740] [2019-12-07 20:47:16,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 20:47:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:16,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:47:16,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:47:34,009 WARN L192 SmtUtils]: Spent 12.07 s on a formula simplification that was a NOOP. DAG size: 14 [2019-12-07 20:48:00,456 WARN L192 SmtUtils]: Spent 10.16 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 20:48:02,511 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) c_ULTIMATE.start_main_~main__y~0) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 20:48:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:48:08,231 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:48:19,821 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)))) is different from true [2019-12-07 20:48:21,877 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2019-12-07 20:48:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:48:25,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307735740] [2019-12-07 20:48:25,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:48:25,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-12-07 20:48:25,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800596992] [2019-12-07 20:48:25,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:48:25,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:48:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:48:25,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=41, Unknown=14, NotChecked=48, Total=132 [2019-12-07 20:48:25,347 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-12-07 20:49:02,445 WARN L192 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 24 DAG size of output: 10 [2019-12-07 20:49:56,583 WARN L192 SmtUtils]: Spent 31.48 s on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 20:50:00,806 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) c_ULTIMATE.start_main_~main__y~0) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)))) is different from false [2019-12-07 20:50:05,603 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) c_ULTIMATE.start_main_~main__y~0) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) is different from false [2019-12-07 20:50:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:50:05,627 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-12-07 20:50:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:50:05,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 20:50:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:50:05,629 INFO L225 Difference]: With dead ends: 22 [2019-12-07 20:50:05,629 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 20:50:05,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 145.3s TimeCoverageRelationStatistics Valid=45, Invalid=54, Unknown=31, NotChecked=110, Total=240 [2019-12-07 20:50:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 20:50:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 20:50:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 20:50:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-12-07 20:50:05,632 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2019-12-07 20:50:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:50:05,632 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-12-07 20:50:05,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:50:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-12-07 20:50:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:50:05,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:50:05,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:50:05,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:50:05,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:50:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:50:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash -101291445, now seen corresponding path program 1 times [2019-12-07 20:50:05,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:50:05,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142485921] [2019-12-07 20:50:05,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 20:50:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:50:06,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:50:06,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:50:08,541 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 20:50:10,777 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 20:50:17,455 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from false [2019-12-07 20:50:19,652 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from true [2019-12-07 20:50:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:50:33,027 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:50:36,098 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2019-12-07 20:50:38,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from false [2019-12-07 20:50:40,527 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from true [2019-12-07 20:50:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:50:40,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142485921] [2019-12-07 20:50:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:50:40,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-12-07 20:50:40,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976827755] [2019-12-07 20:50:40,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:50:40,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:50:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:50:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=22, Unknown=7, NotChecked=60, Total=110 [2019-12-07 20:50:40,532 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 11 states. [2019-12-07 20:50:42,730 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 20:50:44,958 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2019-12-07 20:50:47,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse1))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2019-12-07 20:50:50,650 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)))) is different from false [2019-12-07 20:50:52,885 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) is different from false [2019-12-07 20:50:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:50:52,891 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-12-07 20:50:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:50:52,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-12-07 20:50:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:50:52,892 INFO L225 Difference]: With dead ends: 14 [2019-12-07 20:50:52,892 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:50:52,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=29, Invalid=25, Unknown=12, NotChecked=144, Total=210 [2019-12-07 20:50:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:50:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:50:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:50:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:50:52,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-12-07 20:50:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:50:52,893 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:50:52,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:50:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:50:52,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:50:53,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:50:53,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:52:27,593 WARN L192 SmtUtils]: Spent 1.57 m on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 20:52:27,595 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:52:27,595 INFO L246 CegarLoopResult]: For program point L29(lines 29 55) no Hoare annotation was computed. [2019-12-07 20:52:27,595 INFO L246 CegarLoopResult]: For program point L27(lines 27 60) no Hoare annotation was computed. [2019-12-07 20:52:27,595 INFO L242 CegarLoopResult]: At program point L54(lines 29 55) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2019-12-07 20:52:27,596 INFO L246 CegarLoopResult]: For program point L19(lines 19 71) no Hoare annotation was computed. [2019-12-07 20:52:27,596 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 20:52:27,596 INFO L246 CegarLoopResult]: For program point L38(lines 38 47) no Hoare annotation was computed. [2019-12-07 20:52:27,596 INFO L242 CegarLoopResult]: At program point L65(lines 22 66) the Hoare annotation is: (let ((.cse5 (fp.geq ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)))) (let ((.cse1 (or (and .cse5 (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) currentRoundingMode 2.0)) (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) (and .cse5 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) ULTIMATE.start_main_~main__y~0)))))) (.cse2 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (or (not .cse5) (fp.leq ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) currentRoundingMode 105.0))))) (or (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode 10.0))) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) .cse1 .cse2 .cse3) (and .cse1 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse4 (fp.mul currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add currentRoundingMode .cse4 ((_ to_fp 11 53) currentRoundingMode 2.0)) ULTIMATE.start_main_~main__y~0) (not (fp.geq (fp.sub currentRoundingMode .cse4 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0))))) .cse2 .cse3)))) [2019-12-07 20:52:27,596 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 20:52:27,597 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:52:27,597 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 20:52:27,597 INFO L242 CegarLoopResult]: At program point L59(lines 27 60) the Hoare annotation is: false [2019-12-07 20:52:27,597 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 40) no Hoare annotation was computed. [2019-12-07 20:52:27,597 INFO L246 CegarLoopResult]: For program point L22(lines 22 66) no Hoare annotation was computed. [2019-12-07 20:52:27,598 INFO L246 CegarLoopResult]: For program point L16(lines 16 76) no Hoare annotation was computed. [2019-12-07 20:52:27,598 INFO L249 CegarLoopResult]: At program point L80(lines 8 82) the Hoare annotation is: true [2019-12-07 20:52:27,598 INFO L246 CegarLoopResult]: For program point L14(lines 14 81) no Hoare annotation was computed. [2019-12-07 20:52:27,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,618 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,618 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,620 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,623 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,633 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,633 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:52:27 BoogieIcfgContainer [2019-12-07 20:52:27,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:52:27,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:52:27,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:52:27,645 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:52:27,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:44:07" (3/4) ... [2019-12-07 20:52:27,648 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:52:27,655 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 20:52:27,655 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 20:52:27,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && (((((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, main__x, main__x), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)), ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (!~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) || ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)))) || ((((((((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, main__x, main__x), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)), ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)) == main__y && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (!~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) || ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)))) [2019-12-07 20:52:27,687 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_addae18f-6e92-4d99-a725-d2709d1533c3/bin/utaipan/witness.graphml [2019-12-07 20:52:27,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:52:27,688 INFO L168 Benchmark]: Toolchain (without parser) took 504158.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 952.4 MB in the beginning and 908.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:52:27,689 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:52:27,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:52:27,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.90 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:52:27,690 INFO L168 Benchmark]: Boogie Preprocessor took 47.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:52:27,690 INFO L168 Benchmark]: RCFGBuilder took 3398.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:52:27,690 INFO L168 Benchmark]: TraceAbstraction took 500482.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 908.1 MB in the end (delta: 178.2 MB). Peak memory consumption was 178.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:52:27,690 INFO L168 Benchmark]: Witness Printer took 42.94 ms. Allocated memory is still 1.1 GB. Free memory is still 908.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:52:27,692 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.90 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3398.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 500482.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 908.1 MB in the end (delta: 178.2 MB). Peak memory consumption was 178.2 MB. Max. memory is 11.5 GB. * Witness Printer took 42.94 ms. Allocated memory is still 1.1 GB. Free memory is still 908.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 20:52:27,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2019-12-07 20:52:27,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-12-07 20:52:27,714 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-12-07 20:52:27,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2019-12-07 20:52:27,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode Derived loop invariant: ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && (((((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, main__x, main__x), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)), ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (!~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) || ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)))) || ((((((((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, main__x, main__x), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)), ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)) == main__y && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (!~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) || ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 405.8s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 201.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 94.4s, HoareTripleCheckerStatistics: 54 SDtfs, 25 SDslu, 165 SDs, 0 SdLazy, 58 SolverSat, 3 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 45.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 291.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 206 HoareAnnotationTreeSize, 4 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 94.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 201.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 32 QuantifiedInterpolants, 12265 SizeOfPredicates, 19 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...