./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/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 97ac2503801a101f5a44ae44e4a77e81fa872959 ..................................................................................................................................................................................................................................................................................................................... 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_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/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 97ac2503801a101f5a44ae44e4a77e81fa872959 ................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:21:22,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:21:22,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:21:22,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:21:22,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:21:22,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:21:22,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:21:22,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:21:22,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:21:22,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:21:22,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:21:22,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:21:22,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:21:22,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:21:22,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:21:22,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:21:22,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:21:22,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:21:22,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:21:22,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:21:22,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:21:22,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:21:22,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:21:22,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:21:22,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:21:22,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:21:22,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:21:22,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:21:22,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:21:22,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:21:22,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:21:22,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:21:22,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:21:22,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:21:22,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:21:22,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:21:22,430 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:21:22,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:21:22,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:21:22,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:21:22,441 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:21:22,441 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:21:22,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:21:22,441 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:21:22,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:21:22,442 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:21:22,442 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:21:22,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:21:22,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:21:22,442 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:21:22,442 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:21:22,443 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:21:22,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:21:22,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:21:22,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:21:22,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:21:22,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:21:22,445 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:21:22,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:21:22,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:21:22,445 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:21:22,445 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_04286686-6d32-4cf0-b9a1-30b7a15cd654/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 -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-12-03 07:21:22,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:21:22,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:21:22,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:21:22,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:21:22,482 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:21:22,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-12-03 07:21:22,520 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/aca328ba2/8c4c182a8a1b4ce39ce9d5105c2814ec/FLAG3fdc7f37c [2018-12-03 07:21:22,925 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:21:22,925 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-12-03 07:21:22,929 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/aca328ba2/8c4c182a8a1b4ce39ce9d5105c2814ec/FLAG3fdc7f37c [2018-12-03 07:21:22,937 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/aca328ba2/8c4c182a8a1b4ce39ce9d5105c2814ec [2018-12-03 07:21:22,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:21:22,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:21:22,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:21:22,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:21:22,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:21:22,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:21:22" (1/1) ... [2018-12-03 07:21:22,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7a2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:22, skipping insertion in model container [2018-12-03 07:21:22,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:21:22" (1/1) ... [2018-12-03 07:21:22,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:21:22,966 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:21:23,065 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:21:23,068 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:21:23,081 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:21:23,095 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:21:23,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23 WrapperNode [2018-12-03 07:21:23,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:21:23,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:21:23,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:21:23,096 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:21:23,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:21:23,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:21:23,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:21:23,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:21:23,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... [2018-12-03 07:21:23,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:21:23,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:21:23,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:21:23,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:21:23,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/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-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:21:23,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:21:23,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:21:23,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:21:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 07:21:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:21:23,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:21:23,305 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 07:21:23,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:23 BoogieIcfgContainer [2018-12-03 07:21:23,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:21:23,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:21:23,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:21:23,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:21:23,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:21:22" (1/3) ... [2018-12-03 07:21:23,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0f7ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:23, skipping insertion in model container [2018-12-03 07:21:23,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:23" (2/3) ... [2018-12-03 07:21:23,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0f7ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:23, skipping insertion in model container [2018-12-03 07:21:23,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:23" (3/3) ... [2018-12-03 07:21:23,310 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-12-03 07:21:23,316 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:21:23,321 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:21:23,331 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:21:23,349 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:21:23,349 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:21:23,349 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:21:23,349 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:21:23,349 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:21:23,349 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:21:23,349 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:21:23,349 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:21:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 07:21:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 07:21:23,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:21:23,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:21:23,364 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:21:23,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:21:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1326004698, now seen corresponding path program 1 times [2018-12-03 07:21:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:21:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:21:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:21:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:21:23,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:21:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:21:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:21:23,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:21:23,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:21:23,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:21:23,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:21:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:21:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:21:23,486 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-12-03 07:21:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:21:23,518 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 07:21:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:21:23,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 07:21:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:21:23,524 INFO L225 Difference]: With dead ends: 30 [2018-12-03 07:21:23,525 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 07:21:23,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:21:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 07:21:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 07:21:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 07:21:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 07:21:23,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 07:21:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:21:23,547 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 07:21:23,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:21:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 07:21:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 07:21:23,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:21:23,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:21:23,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:21:23,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:21:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1310900661, now seen corresponding path program 1 times [2018-12-03 07:21:23,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:21:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:21:23,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:21:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:21:23,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:21:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:21:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:21:23,588 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:21:23,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:21:23 BoogieIcfgContainer [2018-12-03 07:21:23,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:21:23,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:21:23,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:21:23,608 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:21:23,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:23" (3/4) ... [2018-12-03 07:21:23,610 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 07:21:23,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:21:23,611 INFO L168 Benchmark]: Toolchain (without parser) took 670.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-03 07:21:23,612 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:21:23,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.98 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:21:23,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.07 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:21:23,613 INFO L168 Benchmark]: Boogie Preprocessor took 50.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-03 07:21:23,613 INFO L168 Benchmark]: RCFGBuilder took 143.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:21:23,614 INFO L168 Benchmark]: TraceAbstraction took 301.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-12-03 07:21:23,614 INFO L168 Benchmark]: Witness Printer took 2.74 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-12-03 07:21:23,616 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.98 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.07 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 301.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 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: 54]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L1] int __return_main; [L12] float __return_72; [L13] int __return_87; VAL [\old(__return_72)=10, \old(__return_87)=7, \old(__return_main)=8, __return_72=0, __return_87=0, __return_main=0] [L16] float main__a; [L17] float main__r; [L18] main__a = __VERIFIER_nondet_float() [L19] int main____CPAchecker_TMP_0; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L20] COND TRUE main__a >= 0.10000000149011612 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L22] COND TRUE main__a <= 100.0 [L24] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main____CPAchecker_TMP_0=1, main__a=16] [L25] COND TRUE main____CPAchecker_TMP_0 != 0 [L28] float __tmp_1; [L29] __tmp_1 = main__a [L30] float InvSqrt__x; [L31] InvSqrt__x = __tmp_1 [L32] float InvSqrt__xhalf = 0.5 * InvSqrt__x; [L33] union float_int InvSqrt__i; [L34] InvSqrt__i.f = InvSqrt__x [L35] EXPR InvSqrt__i.i [L35] InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) [L36] EXPR InvSqrt__i.f [L36] InvSqrt__x = InvSqrt__i.f [L37] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L38] __return_72 = InvSqrt__x [L39] main__r = __return_72 [L40] int main____CPAchecker_TMP_1; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L41] COND FALSE !(main__r >= 0.0) VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L67] main____CPAchecker_TMP_1 = 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L48] int __tmp_2; [L49] __tmp_2 = main____CPAchecker_TMP_1 [L50] int __VERIFIER_assert__cond; [L51] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L52] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L54] __VERIFIER_error() VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 5 SDslu, 43 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 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-635dfa2 [2018-12-03 07:21:24,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:21:24,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:21:24,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:21:24,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:21:24,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:21:24,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:21:24,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:21:24,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:21:24,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:21:24,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:21:24,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:21:24,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:21:24,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:21:24,947 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:21:24,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:21:24,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:21:24,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:21:24,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:21:24,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:21:24,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:21:24,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:21:24,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:21:24,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:21:24,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:21:24,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:21:24,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:21:24,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:21:24,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:21:24,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:21:24,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:21:24,956 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:21:24,956 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:21:24,956 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:21:24,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:21:24,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:21:24,957 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 07:21:24,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:21:24,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:21:24,965 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:21:24,966 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:21:24,966 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:21:24,966 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:21:24,966 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:21:24,966 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:21:24,966 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:21:24,966 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:21:24,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:21:24,967 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:21:24,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:21:24,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:21:24,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:21:24,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:21:24,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:21:24,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:21:24,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:21:24,969 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:21:24,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:21:24,970 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:21:24,970 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 07:21:24,970 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_04286686-6d32-4cf0-b9a1-30b7a15cd654/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 -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-12-03 07:21:24,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:21:24,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:21:24,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:21:24,998 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:21:24,998 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:21:24,999 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-12-03 07:21:25,033 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/f3a7fd186/7c6436cac59445a3bb67dd1fe9c563e4/FLAGecdd7fafd [2018-12-03 07:21:25,456 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:21:25,457 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-12-03 07:21:25,461 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/f3a7fd186/7c6436cac59445a3bb67dd1fe9c563e4/FLAGecdd7fafd [2018-12-03 07:21:25,468 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/data/f3a7fd186/7c6436cac59445a3bb67dd1fe9c563e4 [2018-12-03 07:21:25,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:21:25,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:21:25,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:21:25,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:21:25,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:21:25,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49eb7855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25, skipping insertion in model container [2018-12-03 07:21:25,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:21:25,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:21:25,582 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:21:25,586 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:21:25,601 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:21:25,616 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:21:25,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25 WrapperNode [2018-12-03 07:21:25,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:21:25,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:21:25,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:21:25,617 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:21:25,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:21:25,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:21:25,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:21:25,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:21:25,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... [2018-12-03 07:21:25,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:21:25,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:21:25,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:21:25,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:21:25,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/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-12-03 07:21:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:21:25,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:21:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-12-03 07:21:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:21:25,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:21:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:21:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 07:21:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:21:25,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:21:25,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-12-03 07:21:25,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:21:25,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 07:21:28,114 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:28,213 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:21:28,213 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 07:21:28,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:28 BoogieIcfgContainer [2018-12-03 07:21:28,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:21:28,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:21:28,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:21:28,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:21:28,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:21:25" (1/3) ... [2018-12-03 07:21:28,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d78722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:28, skipping insertion in model container [2018-12-03 07:21:28,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:25" (2/3) ... [2018-12-03 07:21:28,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d78722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:28, skipping insertion in model container [2018-12-03 07:21:28,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:28" (3/3) ... [2018-12-03 07:21:28,218 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-12-03 07:21:28,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:21:28,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:21:28,237 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:21:28,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:21:28,253 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:21:28,253 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:21:28,253 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:21:28,253 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:21:28,254 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:21:28,254 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:21:28,254 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:21:28,254 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:21:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 07:21:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 07:21:28,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:21:28,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:21:28,267 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:21:28,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:21:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1326004698, now seen corresponding path program 1 times [2018-12-03 07:21:28,273 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-03 07:21:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/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-12-03 07:21:28,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:21:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:21:28,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:21:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:21:28,791 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:21:28,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:21:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:21:28,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:21:28,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:21:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:21:28,816 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-12-03 07:21:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:21:31,150 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 07:21:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:21:31,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 07:21:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:21:31,157 INFO L225 Difference]: With dead ends: 30 [2018-12-03 07:21:31,157 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 07:21:31,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:21:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 07:21:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 07:21:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 07:21:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 07:21:31,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 07:21:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:21:31,179 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 07:21:31,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:21:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 07:21:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 07:21:31,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:21:31,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:21:31,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:21:31,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:21:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1310900661, now seen corresponding path program 1 times [2018-12-03 07:21:31,181 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-03 07:21:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/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-12-03 07:21:31,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:21:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:21:32,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:21:32,837 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 07:21:34,940 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from false [2018-12-03 07:21:37,021 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from true [2018-12-03 07:21:43,325 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from false [2018-12-03 07:21:45,413 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from true [2018-12-03 07:21:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:21:58,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:21:58,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:21:58,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:21:58,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:21:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:21:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2018-12-03 07:21:58,098 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-12-03 07:22:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:00,428 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-12-03 07:22:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:22:00,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-03 07:22:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:00,533 INFO L225 Difference]: With dead ends: 21 [2018-12-03 07:22:00,533 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 07:22:00,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2018-12-03 07:22:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 07:22:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 07:22:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 07:22:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-12-03 07:22:00,536 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2018-12-03 07:22:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:00,537 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-12-03 07:22:00,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-12-03 07:22:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 07:22:00,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:00,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:00,538 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:00,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1852104242, now seen corresponding path program 1 times [2018-12-03 07:22:00,538 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-03 07:22:00,538 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04286686-6d32-4cf0-b9a1-30b7a15cd654/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-03 07:22:00,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:02,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:22:03,019 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 07:22:05,128 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from false [2018-12-03 07:22:07,220 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from true [2018-12-03 07:22:09,326 WARN L832 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from false [2018-12-03 07:22:11,922 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from true [2018-12-03 07:22:18,262 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) is different from false [2018-12-03 07:22:20,370 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) is different from true [2018-12-03 07:22:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:33,076 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:22:33,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:33,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:33,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:22:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:22:33,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2018-12-03 07:22:33,093 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 7 states. [2018-12-03 07:22:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:35,497 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-12-03 07:22:35,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:22:35,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 07:22:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:35,608 INFO L225 Difference]: With dead ends: 16 [2018-12-03 07:22:35,608 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 07:22:35,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2018-12-03 07:22:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 07:22:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 07:22:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 07:22:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 07:22:35,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-12-03 07:22:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:35,610 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 07:22:35,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:22:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 07:22:35,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 07:22:35,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 07:22:49,997 WARN L180 SmtUtils]: Spent 14.35 s on a formula simplification that was a NOOP. DAG size: 74 [2018-12-03 07:23:08,514 WARN L180 SmtUtils]: Spent 18.52 s on a formula simplification that was a NOOP. DAG size: 76 [2018-12-03 07:23:08,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:23:08,516 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-03 07:23:08,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:23:08,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:23:08,517 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 07:23:08,517 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 07:23:08,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:23:08,517 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 80) no Hoare annotation was computed. [2018-12-03 07:23:08,517 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-12-03 07:23:08,517 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 91) no Hoare annotation was computed. [2018-12-03 07:23:08,517 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-03 07:23:08,517 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 61) no Hoare annotation was computed. [2018-12-03 07:23:08,518 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 91) no Hoare annotation was computed. [2018-12-03 07:23:08,518 INFO L444 ceAbstractionStarter]: At program point L73(lines 41 74) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse5) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse4)) .cse5) .cse5))))))) (_ +zero 11 53))))))) [2018-12-03 07:23:08,518 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 91) the Hoare annotation is: true [2018-12-03 07:23:08,519 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 85) no Hoare annotation was computed. [2018-12-03 07:23:08,519 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 90) no Hoare annotation was computed. [2018-12-03 07:23:08,519 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 69) no Hoare annotation was computed. [2018-12-03 07:23:08,519 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 74) no Hoare annotation was computed. [2018-12-03 07:23:08,520 INFO L444 ceAbstractionStarter]: At program point L68(lines 43 69) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse5) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse4)) .cse5) .cse5))))))) (_ +zero 11 53)))))) (= (_ bv1 32) main_~main____CPAchecker_TMP_1~0)) [2018-12-03 07:23:08,523 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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-12-03 07:23:08,525 INFO L168 Benchmark]: Toolchain (without parser) took 103054.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2018-12-03 07:23:08,526 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:23:08,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.80 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:23:08,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.05 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:23:08,528 INFO L168 Benchmark]: Boogie Preprocessor took 17.92 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:23:08,528 INFO L168 Benchmark]: RCFGBuilder took 2562.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-12-03 07:23:08,529 INFO L168 Benchmark]: TraceAbstraction took 100310.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:23:08,532 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.80 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.05 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.92 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2562.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100310.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...