./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton_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_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/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 94c7e44bedb585ab09170efda1a99dc421396ccb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/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 94c7e44bedb585ab09170efda1a99dc421396ccb .................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_3 |inv_~#A_u~0.offset| ((_ extract 31 0) v_prenex_24)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:48:14,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:48:14,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:48:14,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:48:14,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:48:14,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:48:14,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:48:14,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:48:14,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:48:14,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:48:14,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:48:14,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:48:14,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:48:14,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:48:14,140 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:48:14,141 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:48:14,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:48:14,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:48:14,144 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:48:14,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:48:14,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:48:14,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:48:14,148 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:48:14,148 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:48:14,148 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:48:14,149 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:48:14,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:48:14,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:48:14,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:48:14,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:48:14,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:48:14,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:48:14,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:48:14,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:48:14,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:48:14,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:48:14,154 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 15:48:14,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:48:14,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:48:14,164 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:48:14,164 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:48:14,165 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:48:14,165 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:48:14,165 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:48:14,166 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:48:14,166 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:48:14,166 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:48:14,166 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:48:14,166 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:48:14,166 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:48:14,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:48:14,167 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:48:14,167 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:48:14,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:48:14,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:48:14,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:48:14,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:48:14,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:48:14,168 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:48:14,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:48:14,168 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:48:14,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:48:14,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:48:14,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:48:14,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:48:14,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:48:14,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:48:14,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:48:14,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:48:14,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:48:14,171 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:48:14,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:48:14,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:48:14,172 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 15:48:14,172 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_322769cd-c128-4487-b526-772b49c6ebab/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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-11-23 15:48:14,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:48:14,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:48:14,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:48:14,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:48:14,208 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:48:14,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 15:48:14,253 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/c04eb88b6/8d69c998dc6c49f2a8acb21843673842/FLAG6deeb7269 [2018-11-23 15:48:14,600 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:48:14,600 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 15:48:14,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/c04eb88b6/8d69c998dc6c49f2a8acb21843673842/FLAG6deeb7269 [2018-11-23 15:48:15,015 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/c04eb88b6/8d69c998dc6c49f2a8acb21843673842 [2018-11-23 15:48:15,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:48:15,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:48:15,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:48:15,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:48:15,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:48:15,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1538edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15, skipping insertion in model container [2018-11-23 15:48:15,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:48:15,048 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:48:15,166 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:48:15,169 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:48:15,183 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:48:15,196 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:48:15,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15 WrapperNode [2018-11-23 15:48:15,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:48:15,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:48:15,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:48:15,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:48:15,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:48:15,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:48:15,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:48:15,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:48:15,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... [2018-11-23 15:48:15,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:48:15,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:48:15,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:48:15,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:48:15,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/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 15:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:48:15,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 15:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-11-23 15:48:15,305 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-11-23 15:48:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:48:15,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 15:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:48:15,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 15:48:15,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 15:48:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:48:15,429 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:48:15,429 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:48:15,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:15 BoogieIcfgContainer [2018-11-23 15:48:15,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:48:15,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:48:15,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:48:15,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:48:15,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:48:15" (1/3) ... [2018-11-23 15:48:15,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5f43b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:15, skipping insertion in model container [2018-11-23 15:48:15,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:15" (2/3) ... [2018-11-23 15:48:15,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5f43b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:15, skipping insertion in model container [2018-11-23 15:48:15,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:15" (3/3) ... [2018-11-23 15:48:15,436 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-11-23 15:48:15,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:48:15,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:48:15,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:48:15,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:48:15,474 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:48:15,474 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:48:15,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:48:15,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:48:15,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:48:15,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:48:15,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:48:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 15:48:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 15:48:15,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:48:15,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:48:15,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:48:15,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-11-23 15:48:15,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:48:15,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:15,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:48:15,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:15,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:48:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:15,629 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 15:48:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:48:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:48:15,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:48:15,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:48:15,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:48:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:48:15,642 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-11-23 15:48:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:48:15,676 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 15:48:15,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:48:15,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 15:48:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:48:15,683 INFO L225 Difference]: With dead ends: 42 [2018-11-23 15:48:15,683 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 15:48:15,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:48:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 15:48:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 15:48:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 15:48:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 15:48:15,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-23 15:48:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:48:15,708 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 15:48:15,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:48:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 15:48:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:48:15,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:48:15,709 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 15:48:15,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:48:15,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-11-23 15:48:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:48:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:15,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:48:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:48:15,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:48:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:48:15,777 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=9, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=9] [?] RET #38#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet4;havoc #t~nondet4;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [main_~a~0=20.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := inv(~a~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |inv_#in~A|=20.0] [?] ~A := #in~A;havoc ~xi~0;havoc ~xsi~0;havoc ~temp~0;havoc ~cond~0;havoc ~exp~0;call ~#A_u~0.base, ~#A_u~0.offset := #Ultimate.alloc(8);call ~#xi_u~0.base, ~#xi_u~0.offset := #Ultimate.alloc(8);call write~real(~A, ~#A_u~0.base, ~#A_u~0.offset, 8);call #t~mem0 := read~int(~#A_u~0.base, ~#A_u~0.offset, 8);~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023;call write~real(#t~union1, ~#A_u~0.base, ~#A_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call write~real(~convertINTToDOUBLE(1), ~#xi_u~0.base, ~#xi_u~0.offset, 8);call write~int(4503599627370496 * (1023 - ~exp~0), ~#xi_u~0.base, ~#xi_u~0.offset, 8);call #t~mem2 := read~real(~#xi_u~0.base, ~#xi_u~0.offset, 8);~xi~0 := #t~mem2;call write~int(#t~union3, ~#xi_u~0.base, ~#xi_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;~cond~0 := 1; VAL [inv_~A=20.0, inv_~cond~0=1, inv_~exp~0=(- 1024), inv_~xi~0=15.0, |#NULL.base|=0, |#NULL.offset|=0, |inv_#in~A|=20.0, |inv_~#A_u~0.base|=12, |inv_~#A_u~0.offset|=0, |inv_~#xi_u~0.base|=21, |inv_~#xi_u~0.offset|=0] [?] assume !!(0 != ~cond~0);~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0));~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0);~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0);~xi~0 := ~xsi~0; VAL [inv_~A=20.0, inv_~cond~0=0, inv_~exp~0=(- 1024), inv_~xi~0=10.0, inv_~xsi~0=10.0, |#NULL.base|=0, |#NULL.offset|=0, |inv_#in~A|=20.0, |inv_~#A_u~0.base|=12, |inv_~#A_u~0.offset|=0, |inv_~#xi_u~0.base|=21, |inv_~#xi_u~0.offset|=0] [?] assume !(0 != ~cond~0); VAL [inv_~A=20.0, inv_~cond~0=0, inv_~exp~0=(- 1024), inv_~xi~0=10.0, inv_~xsi~0=10.0, |#NULL.base|=0, |#NULL.offset|=0, |inv_#in~A|=20.0, |inv_~#A_u~0.base|=12, |inv_~#A_u~0.offset|=0, |inv_~#xi_u~0.base|=21, |inv_~#xi_u~0.offset|=0] [?] #res := ~xi~0;call ULTIMATE.dealloc(~#A_u~0.base, ~#A_u~0.offset);havoc ~#A_u~0.base, ~#A_u~0.offset;call ULTIMATE.dealloc(~#xi_u~0.base, ~#xi_u~0.offset);havoc ~#xi_u~0.base, ~#xi_u~0.offset; VAL [inv_~A=20.0, inv_~cond~0=0, inv_~exp~0=(- 1024), inv_~xi~0=10.0, inv_~xsi~0=10.0, |#NULL.base|=0, |#NULL.offset|=0, |inv_#in~A|=20.0, |inv_#res|=10.0] [?] assume true; VAL [inv_~A=20.0, inv_~cond~0=0, inv_~exp~0=(- 1024), inv_~xi~0=10.0, inv_~xsi~0=10.0, |#NULL.base|=0, |#NULL.offset|=0, |inv_#in~A|=20.0, |inv_#res|=10.0] [?] RET #42#return; VAL [main_~a~0=20.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=10.0] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=20.0, main_~r~0=10.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, ~a~0=20.0] [L46] CALL call #t~ret5 := inv(~a~0); VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0] [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] call ~#A_u~0.base, ~#A_u~0.offset := #Ultimate.alloc(8); [L23] call ~#xi_u~0.base, ~#xi_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~A, ~#A_u~0.base, ~#A_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#A_u~0.base, ~#A_u~0.offset, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] call write~real(#t~union1, ~#A_u~0.base, ~#A_u~0.offset, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] call write~real(~convertINTToDOUBLE(1), ~#xi_u~0.base, ~#xi_u~0.offset, 8); [L27] call write~int(4503599627370496 * (1023 - ~exp~0), ~#xi_u~0.base, ~#xi_u~0.offset, 8); [L28] call #t~mem2 := read~real(~#xi_u~0.base, ~#xi_u~0.offset, 8); [L28] ~xi~0 := #t~mem2; [L28] call write~int(#t~union3, ~#xi_u~0.base, ~#xi_u~0.offset, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, ~#A_u~0.base=12, ~#A_u~0.offset=0, ~#xi_u~0.base=21, ~#xi_u~0.offset=0, ~A=20.0, ~cond~0=1, ~exp~0=-1024, ~xi~0=15.0] [L30-L35] assume !!(0 != ~cond~0); [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, ~#A_u~0.base=12, ~#A_u~0.offset=0, ~#xi_u~0.base=21, ~#xi_u~0.offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L30-L35] assume !(0 != ~cond~0); VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, ~#A_u~0.base=12, ~#A_u~0.offset=0, ~#xi_u~0.base=21, ~#xi_u~0.offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L36] #res := ~xi~0; [L23] call ULTIMATE.dealloc(~#A_u~0.base, ~#A_u~0.offset); [L36] havoc ~#A_u~0.base, ~#A_u~0.offset; [L23] call ULTIMATE.dealloc(~#xi_u~0.base, ~#xi_u~0.offset); [L36] havoc ~#xi_u~0.base, ~#xi_u~0.offset; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L19-L37] ensures true; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L46] RET call #t~ret5 := inv(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=10.0, ~a~0=20.0] [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=20.0, ~r~0=10.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L11] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L11] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L11] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=9, old(#NULL.base)=16, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, ~a~0=20.0] [L46] CALL call #t~ret5 := inv(~a~0); VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0] [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] call ~#A_u~0.base, ~#A_u~0.offset := #Ultimate.alloc(8); [L23] call ~#xi_u~0.base, ~#xi_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~A, ~#A_u~0.base, ~#A_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#A_u~0.base, ~#A_u~0.offset, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] call write~real(#t~union1, ~#A_u~0.base, ~#A_u~0.offset, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] call write~real(~convertINTToDOUBLE(1), ~#xi_u~0.base, ~#xi_u~0.offset, 8); [L27] call write~int(4503599627370496 * (1023 - ~exp~0), ~#xi_u~0.base, ~#xi_u~0.offset, 8); [L28] call #t~mem2 := read~real(~#xi_u~0.base, ~#xi_u~0.offset, 8); [L28] ~xi~0 := #t~mem2; [L28] call write~int(#t~union3, ~#xi_u~0.base, ~#xi_u~0.offset, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, ~#A_u~0.base=12, ~#A_u~0.offset=0, ~#xi_u~0.base=21, ~#xi_u~0.offset=0, ~A=20.0, ~cond~0=1, ~exp~0=-1024, ~xi~0=15.0] [L30-L35] assume !!(0 != ~cond~0); [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, ~#A_u~0.base=12, ~#A_u~0.offset=0, ~#xi_u~0.base=21, ~#xi_u~0.offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L30-L35] assume !(0 != ~cond~0); VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, ~#A_u~0.base=12, ~#A_u~0.offset=0, ~#xi_u~0.base=21, ~#xi_u~0.offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L36] #res := ~xi~0; [L23] call ULTIMATE.dealloc(~#A_u~0.base, ~#A_u~0.offset); [L36] havoc ~#A_u~0.base, ~#A_u~0.offset; [L23] call ULTIMATE.dealloc(~#xi_u~0.base, ~#xi_u~0.offset); [L36] havoc ~#xi_u~0.base, ~#xi_u~0.offset; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L19-L37] ensures true; VAL [#in~A=20.0, #NULL.base=0, #NULL.offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L46] RET call #t~ret5 := inv(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=10.0, ~a~0=20.0] [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=20.0, ~r~0=10.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L11] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L11] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L11] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0] [L46] CALL call #t~ret5 := inv(~a~0); VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0] [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] ~xi~0 := #t~mem2; [L28] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=1, ~exp~0=-1024, ~xi~0=15.0] [L30-L35] COND FALSE !(!(0 != ~cond~0)) [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L30-L35] COND TRUE !(0 != ~cond~0) VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L36] #res := ~xi~0; [L23] FCALL call ULTIMATE.dealloc(~#A_u~0); [L36] havoc ~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L36] havoc ~#xi_u~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L46] RET call #t~ret5 := inv(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=10.0, ~a~0=20.0] [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0, ~r~0=10.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L11] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0] [L46] CALL call #t~ret5 := inv(~a~0); VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0] [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] ~xi~0 := #t~mem2; [L28] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=1, ~exp~0=-1024, ~xi~0=15.0] [L30-L35] COND FALSE !(!(0 != ~cond~0)) [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L30-L35] COND TRUE !(0 != ~cond~0) VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L36] #res := ~xi~0; [L23] FCALL call ULTIMATE.dealloc(~#A_u~0); [L36] havoc ~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L36] havoc ~#xi_u~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L46] RET call #t~ret5 := inv(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=10.0, ~a~0=20.0] [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0, ~r~0=10.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L11] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0] [L46] CALL call #t~ret5 := inv(~a~0); VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0] [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] ~xi~0 := #t~mem2; [L28] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=1, ~exp~0=-1024, ~xi~0=15.0] [L30-L35] COND FALSE !(!(0 != ~cond~0)) [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L30-L35] COND TRUE !(0 != ~cond~0) VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L36] #res := ~xi~0; [L23] FCALL call ULTIMATE.dealloc(~#A_u~0); [L36] havoc ~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L36] havoc ~#xi_u~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L46] RET call #t~ret5 := inv(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=10.0, ~a~0=20.0] [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0, ~r~0=10.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L11] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=9, old(#NULL!base)=16, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0] [L46] CALL call #t~ret5 := inv(~a~0); VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0] [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] ~xi~0 := #t~mem2; [L28] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=1, ~exp~0=-1024, ~xi~0=15.0] [L30-L35] COND FALSE !(!(0 != ~cond~0)) [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L30-L35] COND TRUE !(0 != ~cond~0) VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, ~#A_u~0!base=12, ~#A_u~0!offset=0, ~#xi_u~0!base=21, ~#xi_u~0!offset=0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L36] #res := ~xi~0; [L23] FCALL call ULTIMATE.dealloc(~#A_u~0); [L36] havoc ~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L36] havoc ~#xi_u~0; VAL [#in~A=20.0, #NULL!base=0, #NULL!offset=0, #res=10.0, ~A=20.0, ~cond~0=0, ~exp~0=-1024, ~xi~0=10.0, ~xsi~0=10.0] [L46] RET call #t~ret5 := inv(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=10.0, ~a~0=20.0] [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=20.0, ~r~0=10.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 0.06) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L11] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L41] double a,r; [L43] a = __VERIFIER_nondet_double() [L46] CALL, EXPR inv(a) VAL [\old(A)=20] [L21] double xi, xsi, temp; [L22] signed int cond, exp; [L23] union double_int A_u, xi_u; [L24] A_u.d = A [L25] EXPR A_u.i [L25] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L26] xi_u.d = 1 [L27] xi_u.i = (((long long)(1023-exp)) << 52) [L28] EXPR xi_u.d [L28] xi = xi_u.d [L29] cond = 1 VAL [\old(A)=20, A=20, A_u={12:0}, cond=1, exp=-1024, xi=15, xi_u={21:0}] [L30] COND TRUE \read(cond) [L31] xsi = 2*xi-A*xi*xi [L32] temp = xsi-xi [L33] cond = ((temp > 1e-10) || (temp < -1e-10)) [L34] xi = xsi VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L30] COND FALSE !(\read(cond)) VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L36] return xi; [L36] return xi; [L36] return xi; VAL [\old(A)=20, \result=10, A=20, cond=0, exp=-1024, xi=10, xsi=10] [L46] RET, EXPR inv(a) VAL [a=20, inv(a)=10] [L46] r = inv(a) [L48] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) VAL [\old(cond)=0] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L11] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 15:48:15,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:48:15 BoogieIcfgContainer [2018-11-23 15:48:15,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:48:15,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:48:15,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:48:15,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:48:15,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:15" (3/4) ... [2018-11-23 15:48:15,814 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:48:15,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:48:15,815 INFO L168 Benchmark]: Toolchain (without parser) took 796.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:15,816 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 15:48:15,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.93 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 15:48:15,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.44 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 15:48:15,817 INFO L168 Benchmark]: Boogie Preprocessor took 16.94 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:15,818 INFO L168 Benchmark]: RCFGBuilder took 200.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -212.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:15,818 INFO L168 Benchmark]: TraceAbstraction took 380.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:48:15,819 INFO L168 Benchmark]: Witness Printer took 3.73 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 15:48:15,821 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 176.93 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 14.44 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 16.94 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -212.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 380.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 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: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of to_real at line 26. Possible FailurePath: [L41] double a,r; [L43] a = __VERIFIER_nondet_double() [L46] CALL, EXPR inv(a) VAL [\old(A)=20] [L21] double xi, xsi, temp; [L22] signed int cond, exp; [L23] union double_int A_u, xi_u; [L24] A_u.d = A [L25] EXPR A_u.i [L25] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L26] xi_u.d = 1 [L27] xi_u.i = (((long long)(1023-exp)) << 52) [L28] EXPR xi_u.d [L28] xi = xi_u.d [L29] cond = 1 VAL [\old(A)=20, A=20, A_u={12:0}, cond=1, exp=-1024, xi=15, xi_u={21:0}] [L30] COND TRUE \read(cond) [L31] xsi = 2*xi-A*xi*xi [L32] temp = xsi-xi [L33] cond = ((temp > 1e-10) || (temp < -1e-10)) [L34] xi = xsi VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L30] COND FALSE !(\read(cond)) VAL [\old(A)=20, A=20, A_u={12:0}, cond=0, exp=-1024, xi=10, xi_u={21:0}, xsi=10] [L36] return xi; [L36] return xi; [L36] return xi; VAL [\old(A)=20, \result=10, A=20, cond=0, exp=-1024, xi=10, xsi=10] [L46] RET, EXPR inv(a) VAL [a=20, inv(a)=10] [L46] r = inv(a) [L48] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) VAL [\old(cond)=0] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L11] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 22 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 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 15:48:17,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:48:17,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:48:17,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:48:17,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:48:17,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:48:17,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:48:17,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:48:17,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:48:17,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:48:17,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:48:17,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:48:17,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:48:17,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:48:17,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:48:17,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:48:17,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:48:17,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:48:17,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:48:17,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:48:17,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:48:17,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:48:17,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:48:17,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:48:17,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:48:17,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:48:17,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:48:17,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:48:17,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:48:17,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:48:17,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:48:17,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:48:17,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:48:17,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:48:17,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:48:17,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:48:17,312 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 15:48:17,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:48:17,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:48:17,323 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:48:17,323 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:48:17,323 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:48:17,323 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:48:17,323 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:48:17,323 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:48:17,324 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:48:17,324 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:48:17,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:48:17,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:48:17,324 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:48:17,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:48:17,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:48:17,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:48:17,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:48:17,326 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:48:17,326 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:48:17,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:48:17,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:48:17,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:48:17,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:48:17,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:48:17,328 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 15:48:17,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:48:17,328 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:48:17,328 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 15:48:17,328 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_322769cd-c128-4487-b526-772b49c6ebab/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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-11-23 15:48:17,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:48:17,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:48:17,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:48:17,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:48:17,366 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:48:17,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 15:48:17,402 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/431141c96/8d618cb7cc69402590cbb9a4016f2eed/FLAG1f8c6be34 [2018-11-23 15:48:17,695 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:48:17,695 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 15:48:17,699 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/431141c96/8d618cb7cc69402590cbb9a4016f2eed/FLAG1f8c6be34 [2018-11-23 15:48:17,708 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/data/431141c96/8d618cb7cc69402590cbb9a4016f2eed [2018-11-23 15:48:17,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:48:17,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:48:17,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:48:17,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:48:17,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:48:17,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f089c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17, skipping insertion in model container [2018-11-23 15:48:17,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:48:17,742 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:48:17,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:48:17,871 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:48:17,888 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:48:17,905 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:48:17,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17 WrapperNode [2018-11-23 15:48:17,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:48:17,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:48:17,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:48:17,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:48:17,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:48:17,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:48:17,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:48:17,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:48:17,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... [2018-11-23 15:48:17,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:48:17,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:48:17,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:48:17,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:48:17,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/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 15:48:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 15:48:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 15:48:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:48:18,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:48:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure inv [2018-11-23 15:48:18,023 INFO L138 BoogieDeclarations]: Found implementation of procedure inv [2018-11-23 15:48:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-23 15:48:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:48:18,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:48:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:48:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:48:18,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:48:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-23 15:48:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 15:48:18,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 15:48:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:48:18,142 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:48:20,247 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:48:20,248 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:48:20,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:20 BoogieIcfgContainer [2018-11-23 15:48:20,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:48:20,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:48:20,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:48:20,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:48:20,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:48:17" (1/3) ... [2018-11-23 15:48:20,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622c5a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:20, skipping insertion in model container [2018-11-23 15:48:20,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:48:17" (2/3) ... [2018-11-23 15:48:20,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622c5a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:48:20, skipping insertion in model container [2018-11-23 15:48:20,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:48:20" (3/3) ... [2018-11-23 15:48:20,254 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton_true-unreach-call.c [2018-11-23 15:48:20,262 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:48:20,268 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:48:20,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:48:20,301 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:48:20,302 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:48:20,302 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:48:20,302 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:48:20,302 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:48:20,302 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:48:20,302 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:48:20,302 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:48:20,302 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:48:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 15:48:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 15:48:20,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:48:20,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:48:20,318 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:48:20,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash 329261632, now seen corresponding path program 1 times [2018-11-23 15:48:20,324 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:48:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/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 15:48:20,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:48:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:20,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:20,422 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 15:48:20,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:48:20,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:48:20,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:48:20,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:48:20,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:48:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:48:20,448 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-11-23 15:48:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:48:22,662 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 15:48:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:48:22,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 15:48:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:48:22,669 INFO L225 Difference]: With dead ends: 42 [2018-11-23 15:48:22,669 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 15:48:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:48:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 15:48:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 15:48:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 15:48:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 15:48:22,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-23 15:48:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:48:22,695 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 15:48:22,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:48:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 15:48:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:48:22,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:48:22,696 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 15:48:22,696 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:48:22,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:48:22,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1085443135, now seen corresponding path program 1 times [2018-11-23 15:48:22,697 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:48:22,697 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/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 15:48:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:48:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:48:23,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:48:23,706 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-11-23 15:48:23,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-11-23 15:48:23,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2018-11-23 15:48:23,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-11-23 15:48:23,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:48:23,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:48:23,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:48:23,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:48:23,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:168, output treesize:57 [2018-11-23 15:48:26,212 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (= (bvadd c_inv_~cond~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.lt (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_prenex_7) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg v_prenex_8) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse0) .cse0)) .cse0)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))))) .cse2) (and (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (inv_~exp~0 (_ BitVec 32))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (concat ((_ extract 63 32) |v_q#valueAsBitvector_2|) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg inv_~exp~0) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse5) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse5) .cse5)) .cse5))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt .cse3 (fp.neg .cse4))) (not (fp.gt .cse3 .cse4))))) (= c_inv_~cond~0 (_ bv0 32))) (and .cse2 (exists ((v_prenex_12 (_ BitVec 64)) (v_prenex_13 (_ BitVec 32))) (and (fp.gt (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) v_prenex_12) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg v_prenex_13) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse7) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse7) .cse7)) .cse7)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))) (= (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))))) is different from false [2018-11-23 15:48:28,301 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (inv_~exp~0 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_2|) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg inv_~exp~0) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |c_inv_#in~A| .cse2) .cse2)) .cse2))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1))))) is different from false [2018-11-23 15:48:36,185 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (inv_~exp~0 (_ BitVec 32)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_2|) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg inv_~exp~0) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~a~0 .cse2) .cse2)) .cse2))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.leq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from false [2018-11-23 15:48:38,241 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 64)) (inv_~exp~0 (_ BitVec 32)) (main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_2|) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg inv_~exp~0) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~a~0 .cse2) .cse2)) .cse2))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_2|) ((_ extract 62 52) |v_q#valueAsBitvector_2|) ((_ extract 51 0) |v_q#valueAsBitvector_2|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.leq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from true [2018-11-23 15:48:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 15:48:54,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:49:25,544 WARN L180 SmtUtils]: Spent 30.77 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-23 15:49:52,436 WARN L180 SmtUtils]: Spent 26.89 s on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 15:50:19,124 WARN L180 SmtUtils]: Spent 26.68 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-23 15:50:46,133 WARN L180 SmtUtils]: Spent 27.01 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-23 15:51:32,493 WARN L180 SmtUtils]: Spent 46.35 s on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-11-23 15:51:34,740 INFO L303 Elim1Store]: Index analysis took 2246 ms [2018-11-23 15:51:34,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 886 treesize of output 838 [2018-11-23 15:51:36,993 INFO L303 Elim1Store]: Index analysis took 2250 ms [2018-11-23 15:51:36,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 703 [2018-11-23 15:51:53,959 WARN L180 SmtUtils]: Spent 16.96 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 15:51:56,212 INFO L303 Elim1Store]: Index analysis took 2251 ms [2018-11-23 15:51:56,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 358 [2018-11-23 15:51:56,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:08,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:21,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:38,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:52:38,356 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:1258, output treesize:370 [2018-11-23 15:52:40,400 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_inv_~exp~0_5 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_5|) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg v_inv_~exp~0_5) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~a~0 .cse2) .cse2)) .cse2))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (or (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1)))) is different from false [2018-11-23 15:52:42,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_inv_~exp~0_5 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_q#valueAsBitvector_5|) ((_ extract 31 0) (bvshl ((_ sign_extend 32) (bvadd (bvneg v_inv_~exp~0_5) (_ bv1023 32))) ((_ sign_extend 32) (_ bv52 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~a~0 .cse2) .cse2)) .cse2))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (or (not (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1)))) is different from true [2018-11-23 15:52:42,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:52:42,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_322769cd-c128-4487-b526-772b49c6ebab/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:52:42,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:42,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:43,853 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2018-11-23 15:52:43,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:52:43,919 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:52:43,920 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:52:43,920 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:52:43,976 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-11-23 15:52:44,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 166 treesize of output 179 [2018-11-23 15:52:45,374 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-23 15:52:45,576 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:52:45,576 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_3 |inv_~#A_u~0.offset| ((_ extract 31 0) v_prenex_24)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 15:52:45,578 INFO L168 Benchmark]: Toolchain (without parser) took 267868.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 948.7 MB in the beginning and 957.4 MB in the end (delta: -8.8 MB). Peak memory consumption was 125.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:52:45,579 INFO L168 Benchmark]: CDTParser took 0.11 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 15:52:45,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:52:45,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.88 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:52:45,580 INFO L168 Benchmark]: Boogie Preprocessor took 27.51 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:52:45,580 INFO L168 Benchmark]: RCFGBuilder took 2296.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:52:45,581 INFO L168 Benchmark]: TraceAbstraction took 265329.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 957.4 MB in the end (delta: 145.9 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:52:45,583 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.11 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 194.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.88 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.51 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2296.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 265329.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 957.4 MB in the end (delta: 145.9 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_3 |inv_~#A_u~0.offset| ((_ extract 31 0) v_prenex_24)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_3 |inv_~#A_u~0.offset| ((_ extract 31 0) v_prenex_24)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...