./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fdec7243d1dcfe44b7db1591097bb1f5b9c1d53 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fdec7243d1dcfe44b7db1591097bb1f5b9c1d53 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:10:57,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:10:57,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:10:57,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:10:57,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:10:57,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:10:57,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:10:57,242 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:10:57,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:10:57,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:10:57,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:10:57,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:10:57,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:10:57,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:10:57,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:10:57,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:10:57,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:10:57,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:10:57,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:10:57,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:10:57,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:10:57,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:10:57,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:10:57,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:10:57,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:10:57,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:10:57,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:10:57,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:10:57,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:10:57,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:10:57,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:10:57,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:10:57,263 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:10:57,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:10:57,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:10:57,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:10:57,265 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:10:57,277 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:10:57,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:10:57,278 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:10:57,278 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:10:57,279 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:10:57,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:10:57,279 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:10:57,279 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:10:57,279 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:10:57,279 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:10:57,279 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:10:57,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:10:57,280 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:10:57,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:10:57,280 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:10:57,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:10:57,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:10:57,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:10:57,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:10:57,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:10:57,281 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:10:57,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:10:57,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:10:57,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:10:57,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:10:57,283 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fdec7243d1dcfe44b7db1591097bb1f5b9c1d53 [2018-11-23 01:10:57,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:10:57,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:10:57,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:10:57,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:10:57,322 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:10:57,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c [2018-11-23 01:10:57,367 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/569246881/93cd31479f574b59956a21e1f682f201/FLAG38e19506b [2018-11-23 01:10:57,733 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:10:57,734 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c [2018-11-23 01:10:57,741 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/569246881/93cd31479f574b59956a21e1f682f201/FLAG38e19506b [2018-11-23 01:10:57,753 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/569246881/93cd31479f574b59956a21e1f682f201 [2018-11-23 01:10:57,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:10:57,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:10:57,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:10:57,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:10:57,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:10:57,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:57" (1/1) ... [2018-11-23 01:10:57,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:57, skipping insertion in model container [2018-11-23 01:10:57,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:57" (1/1) ... [2018-11-23 01:10:57,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:10:57,798 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:10:57,976 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:10:57,978 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:10:57,996 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:10:58,011 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:10:58,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58 WrapperNode [2018-11-23 01:10:58,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:10:58,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:10:58,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:10:58,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:10:58,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:10:58,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:10:58,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:10:58,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:10:58,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... [2018-11-23 01:10:58,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:10:58,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:10:58,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:10:58,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:10:58,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:10:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:10:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:10:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure round_float [2018-11-23 01:10:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure round_float [2018-11-23 01:10:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:10:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:10:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:10:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 01:10:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 01:10:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:10:58,344 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:10:58,344 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 01:10:58,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:58 BoogieIcfgContainer [2018-11-23 01:10:58,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:10:58,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:10:58,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:10:58,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:10:58,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:57" (1/3) ... [2018-11-23 01:10:58,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7a0e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:58, skipping insertion in model container [2018-11-23 01:10:58,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:58" (2/3) ... [2018-11-23 01:10:58,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7a0e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:58, skipping insertion in model container [2018-11-23 01:10:58,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:58" (3/3) ... [2018-11-23 01:10:58,351 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032b_true-unreach-call.c [2018-11-23 01:10:58,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:10:58,365 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:10:58,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:10:58,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:10:58,406 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:10:58,406 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:10:58,406 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:10:58,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:10:58,406 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:10:58,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:10:58,407 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:10:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 01:10:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:10:58,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:10:58,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:10:58,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:10:58,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:10:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 564888569, now seen corresponding path program 1 times [2018-11-23 01:10:58,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:10:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:10:58,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:10:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:10:58,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:10:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:10:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:10:58,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:10:58,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:10:58,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:10:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:10:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:10:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:10:58,545 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 01:10:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:10:58,564 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2018-11-23 01:10:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:10:58,565 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 01:10:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:10:58,576 INFO L225 Difference]: With dead ends: 68 [2018-11-23 01:10:58,576 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 01:10:58,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:10:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 01:10:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 01:10:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 01:10:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 01:10:58,612 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2018-11-23 01:10:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:10:58,612 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 01:10:58,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:10:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 01:10:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:10:58,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:10:58,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:10:58,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:10:58,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:10:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1333163618, now seen corresponding path program 1 times [2018-11-23 01:10:58,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:10:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:10:58,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:10:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:10:58,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:10:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:10:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:10:58,710 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=5, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := round_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] ~x := #in~x;havoc ~w~0;havoc ~exponent_less_127~0; VAL [round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [round_float_~w~0=9, round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] goto; VAL [round_float_~w~0=9, round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [round_float_~exponent_less_127~0=128, round_float_~w~0=9, round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] assume !(~exponent_less_127~0 < 23); VAL [round_float_~exponent_less_127~0=128, round_float_~w~0=9, round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] assume 128 == ~exponent_less_127~0;#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [round_float_~exponent_less_127~0=128, round_float_~w~0=9, round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] assume true; VAL [round_float_~exponent_less_127~0=128, round_float_~w~0=9, round_float_~x=11.0, |#NULL.base|=0, |#NULL.offset|=0, |round_float_#in~x|=11.0] [?] RET #95#return; VAL [main_~x~0=11.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=7.0] [?] ~res~0 := #t~ret6;havoc #t~ret6;#t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [main_~res~0=7.0, main_~x~0=11.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false] [?] assume !#t~short8; VAL [main_~res~0=7.0, main_~x~0=11.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~short8;havoc #t~ret7; VAL [main_~res~0=7.0, main_~x~0=11.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=7.0, main_~x~0=11.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=5, old(#NULL.base)=12, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L76] CALL call #t~ret6 := round_float(~x~0); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0] [L12-L53] ~x := #in~x; [L13] havoc ~w~0; [L15] havoc ~exponent_less_127~0; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~x=11.0] [L18] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] ~w~0 := #t~mem0; [L20] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L18] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~w~0=9, ~x=11.0] [L23] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L25-L46] assume !(~exponent_less_127~0 < 23); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L41-L45] assume 128 == ~exponent_less_127~0; [L43] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L12-L53] ensures true; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L76] RET call #t~ret6 := round_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=7.0, ~x~0=11.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79-L82] assume !#t~short8; [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=7.0, ~x~0=11.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=7.0, ~x~0=11.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=5, old(#NULL.base)=12, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L76] CALL call #t~ret6 := round_float(~x~0); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0] [L12-L53] ~x := #in~x; [L13] havoc ~w~0; [L15] havoc ~exponent_less_127~0; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~x=11.0] [L18] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] ~w~0 := #t~mem0; [L20] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L18] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~w~0=9, ~x=11.0] [L23] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L25-L46] assume !(~exponent_less_127~0 < 23); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L41-L45] assume 128 == ~exponent_less_127~0; [L43] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L12-L53] ensures true; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L76] RET call #t~ret6 := round_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=7.0, ~x~0=11.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79-L82] assume !#t~short8; [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=7.0, ~x~0=11.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=7.0, ~x~0=11.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L76] CALL call #t~ret6 := round_float(~x~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L12-L53] ~x := #in~x; [L13] havoc ~w~0; [L15] havoc ~exponent_less_127~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~x=11.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~w~0 := #t~mem0; [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~w~0=9, ~x=11.0] [L23] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L25] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L41] COND TRUE 128 == ~exponent_less_127~0 [L43] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L76] RET call #t~ret6 := round_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=7.0, ~x~0=11.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L76] CALL call #t~ret6 := round_float(~x~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L12-L53] ~x := #in~x; [L13] havoc ~w~0; [L15] havoc ~exponent_less_127~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~x=11.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~w~0 := #t~mem0; [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~w~0=9, ~x=11.0] [L23] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L25] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L41] COND TRUE 128 == ~exponent_less_127~0 [L43] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L76] RET call #t~ret6 := round_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=7.0, ~x~0=11.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L76] CALL call #t~ret6 := round_float(~x~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L12-L53] ~x := #in~x; [L13] havoc ~w~0; [L15] havoc ~exponent_less_127~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~x=11.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~w~0 := #t~mem0; [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~w~0=9, ~x=11.0] [L23] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L25] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L41] COND TRUE 128 == ~exponent_less_127~0 [L43] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L76] RET call #t~ret6 := round_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=7.0, ~x~0=11.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L76] CALL call #t~ret6 := round_float(~x~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L12-L53] ~x := #in~x; [L13] havoc ~w~0; [L15] havoc ~exponent_less_127~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~x=11.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~w~0 := #t~mem0; [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~w~0=9, ~x=11.0] [L23] ~exponent_less_127~0 := (if ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 else ~bitwiseAnd(~w~0, 2139095040) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L25] COND FALSE !(~exponent_less_127~0 < 23) VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L41] COND TRUE 128 == ~exponent_less_127~0 [L43] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_127~0=128, ~w~0=9, ~x=11.0] [L76] RET call #t~ret6 := round_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=7.0, ~x~0=11.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=7.0, ~x~0=11.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=7.0, ~x~0=11.0] [L75] float x = -0.0f; [L76] CALL, EXPR round_float(x) VAL [\old(x)=11] [L13] __uint32_t w; [L15] int exponent_less_127; VAL [\old(x)=11, x=11] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] exponent_less_127 = (int)((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=11, exponent_less_127=128, w=9, x=11] [L25] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=11, exponent_less_127=128, w=9, x=11] [L41] COND TRUE exponent_less_127 == 128 [L43] return x + x; VAL [\old(x)=11, exponent_less_127=128, w=9, x=11] [L76] RET, EXPR round_float(x) VAL [round_float(x)=7, x=11] [L76] float res = round_float(x); [L79] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=7, res == -0.0f && __signbit_float(res) == 1=0, x=11] [L79] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L80] __VERIFIER_error() VAL [res=7, x=11] ----- [2018-11-23 01:10:58,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:10:58 BoogieIcfgContainer [2018-11-23 01:10:58,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:10:58,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:10:58,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:10:58,750 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:10:58,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:58" (3/4) ... [2018-11-23 01:10:58,755 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:10:58,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:10:58,756 INFO L168 Benchmark]: Toolchain (without parser) took 999.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:10:58,758 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:10:58,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:10:58,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.73 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:10:58,759 INFO L168 Benchmark]: Boogie Preprocessor took 72.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -202.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:10:58,760 INFO L168 Benchmark]: RCFGBuilder took 241.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:10:58,761 INFO L168 Benchmark]: TraceAbstraction took 404.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:10:58,761 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:10:58,765 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.73 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -202.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 241.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 404.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of bitwiseAnd at line 23, overapproximation of someUnaryFLOAToperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L75] float x = -0.0f; [L76] CALL, EXPR round_float(x) VAL [\old(x)=11] [L13] __uint32_t w; [L15] int exponent_less_127; VAL [\old(x)=11, x=11] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] exponent_less_127 = (int)((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=11, exponent_less_127=128, w=9, x=11] [L25] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=11, exponent_less_127=128, w=9, x=11] [L41] COND TRUE exponent_less_127 == 128 [L43] return x + x; VAL [\old(x)=11, exponent_less_127=128, w=9, x=11] [L76] RET, EXPR round_float(x) VAL [round_float(x)=7, x=11] [L76] float res = round_float(x); [L79] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=7, res == -0.0f && __signbit_float(res) == 1=0, x=11] [L79] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L80] __VERIFIER_error() VAL [res=7, x=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 01:11:00,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:11:00,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:11:00,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:11:00,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:11:00,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:11:00,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:11:00,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:11:00,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:11:00,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:11:00,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:11:00,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:11:00,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:11:00,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:11:00,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:11:00,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:11:00,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:11:00,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:11:00,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:11:00,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:11:00,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:11:00,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:11:00,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:11:00,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:11:00,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:11:00,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:11:00,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:11:00,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:11:00,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:11:00,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:11:00,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:11:00,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:11:00,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:11:00,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:11:00,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:11:00,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:11:00,536 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 01:11:00,549 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:11:00,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:11:00,550 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:11:00,550 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:11:00,550 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:11:00,550 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:11:00,551 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:11:00,551 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:11:00,551 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:11:00,551 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:11:00,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:11:00,552 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:11:00,552 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:11:00,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:11:00,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:11:00,553 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:11:00,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:11:00,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:11:00,554 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:11:00,554 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:11:00,554 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:11:00,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:11:00,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:11:00,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:11:00,555 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:11:00,555 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:11:00,555 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:11:00,556 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:11:00,556 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:11:00,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fdec7243d1dcfe44b7db1591097bb1f5b9c1d53 [2018-11-23 01:11:00,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:11:00,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:11:00,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:11:00,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:11:00,603 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:11:00,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c [2018-11-23 01:11:00,647 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/dbe77f2ab/dd0c5b482cc54a6a88b26fe05723e35c/FLAGd9ed24b76 [2018-11-23 01:11:01,002 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:11:01,003 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/sv-benchmarks/c/float-newlib/float_req_bl_1032b_true-unreach-call.c [2018-11-23 01:11:01,008 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/dbe77f2ab/dd0c5b482cc54a6a88b26fe05723e35c/FLAGd9ed24b76 [2018-11-23 01:11:01,021 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/data/dbe77f2ab/dd0c5b482cc54a6a88b26fe05723e35c [2018-11-23 01:11:01,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:11:01,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:11:01,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:11:01,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:11:01,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:11:01,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3498eb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 01:11:01,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:11:01,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:11:01,229 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:11:01,234 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:11:01,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:11:01,281 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:11:01,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01 WrapperNode [2018-11-23 01:11:01,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:11:01,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:11:01,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:11:01,282 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:11:01,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:11:01,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:11:01,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:11:01,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:11:01,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 01:11:01,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:11:01,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:11:01,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:11:01,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:11:01,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:11:01,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:11:01,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:11:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 01:11:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:11:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:11:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:11:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:11:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure round_float [2018-11-23 01:11:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure round_float [2018-11-23 01:11:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:11:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:11:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 01:11:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 01:11:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 01:11:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:11:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:11:01,665 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:11:01,666 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 01:11:01,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01 BoogieIcfgContainer [2018-11-23 01:11:01,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:11:01,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:11:01,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:11:01,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:11:01,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:11:01" (1/3) ... [2018-11-23 01:11:01,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ab2609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 01:11:01,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (2/3) ... [2018-11-23 01:11:01,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ab2609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 01:11:01,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01" (3/3) ... [2018-11-23 01:11:01,671 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032b_true-unreach-call.c [2018-11-23 01:11:01,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:11:01,685 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:11:01,701 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:11:01,724 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:11:01,724 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:11:01,724 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:11:01,725 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:11:01,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:11:01,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:11:01,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:11:01,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:11:01,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:11:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 01:11:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:11:01,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:11:01,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:01,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:11:01,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash 564888569, now seen corresponding path program 1 times [2018-11-23 01:11:01,752 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:11:01,752 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/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 [2018-11-23 01:11:01,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:01,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:11:01,841 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:11:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:01,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:11:01,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:11:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:11:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:11:01,866 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 01:11:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:01,883 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2018-11-23 01:11:01,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:11:01,884 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 01:11:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:11:01,894 INFO L225 Difference]: With dead ends: 68 [2018-11-23 01:11:01,895 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 01:11:01,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:11:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 01:11:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 01:11:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 01:11:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 01:11:01,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2018-11-23 01:11:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:11:01,934 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 01:11:01,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:11:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 01:11:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:11:01,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:11:01,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:01,935 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:11:01,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1333163618, now seen corresponding path program 1 times [2018-11-23 01:11:01,936 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:11:01,936 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/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 [2018-11-23 01:11:01,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:01,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:11:02,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:11:02,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:02,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:11:02,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:11:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:11:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:11:02,111 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 7 states. [2018-11-23 01:11:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:02,519 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 01:11:02,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:11:02,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 01:11:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:11:02,522 INFO L225 Difference]: With dead ends: 51 [2018-11-23 01:11:02,522 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 01:11:02,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:11:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 01:11:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 01:11:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 01:11:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 01:11:02,528 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-11-23 01:11:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:11:02,528 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 01:11:02,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:11:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 01:11:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:11:02,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:11:02,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:02,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:11:02,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1215677854, now seen corresponding path program 1 times [2018-11-23 01:11:02,530 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:11:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/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 [2018-11-23 01:11:02,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:02,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:11:02,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:11:02,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:02,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:11:02,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:11:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:11:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:11:02,707 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 7 states. [2018-11-23 01:11:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:03,051 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 01:11:03,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:11:03,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 01:11:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:11:03,057 INFO L225 Difference]: With dead ends: 53 [2018-11-23 01:11:03,057 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:11:03,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:11:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:11:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 01:11:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:11:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 01:11:03,064 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2018-11-23 01:11:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:11:03,065 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 01:11:03,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:11:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 01:11:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:11:03,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:11:03,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:03,066 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:11:03,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash 734742422, now seen corresponding path program 1 times [2018-11-23 01:11:03,067 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:11:03,067 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/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 [2018-11-23 01:11:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:03,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:11:03,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:11:03,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:03,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:11:03,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:11:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:11:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:11:03,246 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2018-11-23 01:11:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:03,464 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 01:11:03,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:11:03,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 01:11:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:11:03,466 INFO L225 Difference]: With dead ends: 50 [2018-11-23 01:11:03,466 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:11:03,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:11:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:11:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 01:11:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:11:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 01:11:03,470 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-11-23 01:11:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:11:03,470 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 01:11:03,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:11:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 01:11:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:11:03,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:11:03,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:03,471 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:11:03,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash 341715412, now seen corresponding path program 1 times [2018-11-23 01:11:03,472 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:11:03,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/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 [2018-11-23 01:11:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:03,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:11:03,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:11:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:11:03,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:11:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:11:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:11:03,606 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 7 states. [2018-11-23 01:11:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:03,699 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-11-23 01:11:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:11:03,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 01:11:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:11:03,700 INFO L225 Difference]: With dead ends: 35 [2018-11-23 01:11:03,700 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:11:03,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:11:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:11:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 01:11:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:11:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2018-11-23 01:11:03,704 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 23 [2018-11-23 01:11:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:11:03,705 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2018-11-23 01:11:03,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:11:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2018-11-23 01:11:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 01:11:03,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:11:03,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:03,706 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:11:03,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash 841303647, now seen corresponding path program 1 times [2018-11-23 01:11:03,707 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:11:03,707 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 01:11:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:03,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:11:04,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:11:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 01:11:04,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 01:11:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 01:11:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:11:04,116 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand 15 states. [2018-11-23 01:11:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:04,859 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2018-11-23 01:11:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 01:11:04,860 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-11-23 01:11:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:11:04,860 INFO L225 Difference]: With dead ends: 32 [2018-11-23 01:11:04,860 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:11:04,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-11-23 01:11:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:11:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:11:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:11:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:11:04,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 01:11:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:11:04,862 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:11:04,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 01:11:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:11:04,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:11:04,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:11:04,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:11:04,937 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:11:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:11:04,937 INFO L451 ceAbstractionStarter]: At program point round_floatENTRY(lines 12 53) the Hoare annotation is: true [2018-11-23 01:11:04,937 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 35) no Hoare annotation was computed. [2018-11-23 01:11:04,937 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 46) no Hoare annotation was computed. [2018-11-23 01:11:04,937 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-23 01:11:04,937 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 21) the Hoare annotation is: (= round_float_~x |round_float_#in~x|) [2018-11-23 01:11:04,937 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-23 01:11:04,937 INFO L448 ceAbstractionStarter]: For program point round_floatFINAL(lines 12 53) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point round_floatEXIT(lines 12 53) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 39) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 51) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 12 53) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point L47-2(lines 47 51) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 45) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:11:04,938 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:11:04,938 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:11:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 67 85) the Hoare annotation is: true [2018-11-23 01:11:04,939 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 67 85) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L444 ceAbstractionStarter]: At program point L79-1(line 79) the Hoare annotation is: (and |main_#t~short8| (exists ((v_round_float_~w~0_14 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_round_float_~w~0_14) ((_ extract 30 23) v_round_float_~w~0_14) ((_ extract 22 0) v_round_float_~w~0_14)) (fp.neg (_ +zero 8 24))) (= main_~res~0 (let ((.cse0 (bvand (_ bv2147483648 32) v_round_float_~w~0_14))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (= main_~x~0 (fp.neg (_ +zero 8 24)))) [2018-11-23 01:11:04,939 INFO L448 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 67 85) no Hoare annotation was computed. [2018-11-23 01:11:04,939 INFO L444 ceAbstractionStarter]: At program point L76(line 76) the Hoare annotation is: (= main_~x~0 (fp.neg (_ +zero 8 24))) [2018-11-23 01:11:04,940 INFO L448 ceAbstractionStarter]: For program point L76-1(line 76) no Hoare annotation was computed. [2018-11-23 01:11:04,940 INFO L448 ceAbstractionStarter]: For program point L79-4(lines 79 82) no Hoare annotation was computed. [2018-11-23 01:11:04,940 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 58 62) no Hoare annotation was computed. [2018-11-23 01:11:04,940 INFO L444 ceAbstractionStarter]: At program point L58-2(lines 58 62) the Hoare annotation is: (= |__signbit_float_#in~x| __signbit_float_~x) [2018-11-23 01:11:04,940 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 55 65) no Hoare annotation was computed. [2018-11-23 01:11:04,940 INFO L448 ceAbstractionStarter]: For program point L58-3(lines 58 62) no Hoare annotation was computed. [2018-11-23 01:11:04,940 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 55 65) the Hoare annotation is: true [2018-11-23 01:11:04,940 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 55 65) no Hoare annotation was computed. [2018-11-23 01:11:04,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:11:04 BoogieIcfgContainer [2018-11-23 01:11:04,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:11:04,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:11:04,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:11:04,951 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:11:04,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01" (3/4) ... [2018-11-23 01:11:04,954 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:11:04,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:11:04,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure round_float [2018-11-23 01:11:04,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:11:04,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-23 01:11:04,964 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-23 01:11:04,964 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 01:11:04,964 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 01:11:04,987 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 01:11:04,988 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 01:11:05,012 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb71ca15-bd72-4edd-acf9-d21f38a85a66/bin-2019/utaipan/witness.graphml [2018-11-23 01:11:05,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:11:05,013 INFO L168 Benchmark]: Toolchain (without parser) took 3989.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 953.2 MB in the beginning and 846.2 MB in the end (delta: 107.0 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:05,014 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:05,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.69 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:05,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.06 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:05,015 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:05,016 INFO L168 Benchmark]: RCFGBuilder took 336.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:05,016 INFO L168 Benchmark]: TraceAbstraction took 3283.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 853.1 MB in the end (delta: 248.9 MB). Peak memory consumption was 248.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:05,016 INFO L168 Benchmark]: Witness Printer took 61.44 ms. Allocated memory is still 1.2 GB. Free memory was 853.1 MB in the beginning and 846.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:05,019 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.69 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.06 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 336.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3283.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 853.1 MB in the end (delta: 248.9 MB). Peak memory consumption was 248.9 MB. Max. memory is 11.5 GB. * Witness Printer took 61.44 ms. Allocated memory is still 1.2 GB. Free memory was 853.1 MB in the beginning and 846.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: 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: 58]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 124 SDslu, 630 SDs, 0 SdLazy, 310 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 21 NumberOfFragments, 49 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 128 ConstructedInterpolants, 35 QuantifiedInterpolants, 22889 SizeOfPredicates, 23 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...