./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --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.24-0ed9222-m [2019-01-12 08:27:01,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:27:01,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:27:01,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:27:01,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:27:01,548 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:27:01,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:27:01,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:27:01,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:27:01,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:27:01,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:27:01,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:27:01,558 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:27:01,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:27:01,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:27:01,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:27:01,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:27:01,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:27:01,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:27:01,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:27:01,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:27:01,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:27:01,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:27:01,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:27:01,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:27:01,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:27:01,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:27:01,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:27:01,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:27:01,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:27:01,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:27:01,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:27:01,582 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:27:01,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:27:01,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:27:01,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:27:01,585 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 08:27:01,601 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:27:01,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:27:01,603 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:27:01,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:27:01,603 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:27:01,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:27:01,604 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:27:01,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:27:01,605 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:27:01,605 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:27:01,605 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:27:01,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:27:01,605 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:27:01,605 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:27:01,606 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:27:01,606 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:27:01,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:27:01,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:27:01,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:27:01,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:27:01,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:27:01,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:27:01,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:27:01,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:27:01,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:27:01,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:27:01,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:27:01,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:27:01,610 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 [2019-01-12 08:27:01,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:27:01,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:27:01,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:27:01,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:27:01,667 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:27:01,668 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2019-01-12 08:27:01,727 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f835143/6da4bc1cfb434778bf041d7f4934ad43/FLAG909e4e64d [2019-01-12 08:27:02,226 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:27:02,227 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2019-01-12 08:27:02,234 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f835143/6da4bc1cfb434778bf041d7f4934ad43/FLAG909e4e64d [2019-01-12 08:27:02,568 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f835143/6da4bc1cfb434778bf041d7f4934ad43 [2019-01-12 08:27:02,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:27:02,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:27:02,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:27:02,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:27:02,580 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:27:02,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2359d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02, skipping insertion in model container [2019-01-12 08:27:02,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:27:02,615 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:27:02,822 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:27:02,827 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:27:02,857 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:27:02,885 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:27:02,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02 WrapperNode [2019-01-12 08:27:02,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:27:02,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:27:02,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:27:02,888 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:27:02,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:27:02,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:27:02,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:27:02,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:27:02,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:02,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:03,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:03,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... [2019-01-12 08:27:03,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:27:03,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:27:03,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:27:03,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:27:03,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:27:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 08:27:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 08:27:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 08:27:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 08:27:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:27:03,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:27:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 08:27:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 08:27:03,534 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:27:03,534 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:27:03,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:27:03 BoogieIcfgContainer [2019-01-12 08:27:03,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:27:03,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:27:03,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:27:03,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:27:03,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:27:02" (1/3) ... [2019-01-12 08:27:03,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327d59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:27:03, skipping insertion in model container [2019-01-12 08:27:03,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:02" (2/3) ... [2019-01-12 08:27:03,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327d59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:27:03, skipping insertion in model container [2019-01-12 08:27:03,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:27:03" (3/3) ... [2019-01-12 08:27:03,546 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2019-01-12 08:27:03,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:27:03,572 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:27:03,590 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:27:03,624 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:27:03,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:27:03,625 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:27:03,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:27:03,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:27:03,625 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:27:03,625 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:27:03,625 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:27:03,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:27:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 08:27:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 08:27:03,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:27:03,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:27:03,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:27:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:27:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2137295023, now seen corresponding path program 1 times [2019-01-12 08:27:03,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:27:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:27:03,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:27:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:27:03,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:27:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:27:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:27:03,836 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:27:03,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:27:03 BoogieIcfgContainer [2019-01-12 08:27:03,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:27:03,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:27:03,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:27:03,870 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:27:03,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:27:03" (3/4) ... [2019-01-12 08:27:03,876 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:27:03,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:27:03,877 INFO L168 Benchmark]: Toolchain (without parser) took 1304.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:27:03,879 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:27:03,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.94 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 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. [2019-01-12 08:27:03,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.65 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:27:03,883 INFO L168 Benchmark]: Boogie Preprocessor took 128.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -221.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:27:03,884 INFO L168 Benchmark]: RCFGBuilder took 467.95 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-12 08:27:03,885 INFO L168 Benchmark]: TraceAbstraction took 330.74 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:27:03,887 INFO L168 Benchmark]: Witness Printer took 6.28 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. [2019-01-12 08:27:03,892 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.94 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 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 53.65 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -221.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.95 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 330.74 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.28 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 [__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 [__return_72=0, __return_87=0, __return_main=0] [L20] COND TRUE main__a >= 0.10000000149011612 VAL [__return_72=0, __return_87=0, __return_main=0] [L22] COND TRUE main__a <= 100.0 [L24] main____CPAchecker_TMP_0 = 1 VAL [__return_72=0, __return_87=0, __return_main=0] [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 [__return_72=6, __return_87=0, __return_main=0] [L41] COND FALSE !(main__r >= 0.0) VAL [__return_72=6, __return_87=0, __return_main=0] [L67] main____CPAchecker_TMP_1 = 0 VAL [__return_72=6, __return_87=0, __return_main=0] [L48] int __tmp_2; [L49] __tmp_2 = main____CPAchecker_TMP_1 [L50] int __VERIFIER_assert__cond; [L51] __VERIFIER_assert__cond = __tmp_2 VAL [__return_72=6, __return_87=0, __return_main=0] [L52] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_72=6, __return_87=0, __return_main=0] [L54] __VERIFIER_error() VAL [__return_72=6, __return_87=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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.24-0ed9222-m [2019-01-12 08:27:06,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:27:06,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:27:06,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:27:06,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:27:06,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:27:06,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:27:06,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:27:06,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:27:06,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:27:06,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:27:06,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:27:06,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:27:06,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:27:06,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:27:06,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:27:06,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:27:06,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:27:06,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:27:06,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:27:06,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:27:06,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:27:06,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:27:06,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:27:06,189 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:27:06,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:27:06,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:27:06,192 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:27:06,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:27:06,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:27:06,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:27:06,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:27:06,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:27:06,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:27:06,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:27:06,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:27:06,198 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 08:27:06,213 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:27:06,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:27:06,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:27:06,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:27:06,214 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:27:06,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:27:06,215 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:27:06,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:27:06,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:27:06,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:27:06,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:27:06,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:27:06,217 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:27:06,217 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:27:06,217 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:27:06,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:27:06,218 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:27:06,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:27:06,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:27:06,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:27:06,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:27:06,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:27:06,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:27:06,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:27:06,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:27:06,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:27:06,221 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:27:06,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:27:06,221 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:27:06,221 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:27:06,221 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 [2019-01-12 08:27:06,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:27:06,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:27:06,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:27:06,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:27:06,279 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:27:06,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2019-01-12 08:27:06,344 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fe3c7eb/e1f8067fcf9c41f0861481ab038b6528/FLAG924992a20 [2019-01-12 08:27:06,836 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:27:06,839 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2019-01-12 08:27:06,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fe3c7eb/e1f8067fcf9c41f0861481ab038b6528/FLAG924992a20 [2019-01-12 08:27:07,187 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fe3c7eb/e1f8067fcf9c41f0861481ab038b6528 [2019-01-12 08:27:07,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:27:07,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:27:07,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:27:07,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:27:07,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:27:07,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290c9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07, skipping insertion in model container [2019-01-12 08:27:07,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:27:07,234 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:27:07,409 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:27:07,417 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:27:07,447 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:27:07,476 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:27:07,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07 WrapperNode [2019-01-12 08:27:07,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:27:07,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:27:07,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:27:07,478 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:27:07,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:27:07,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:27:07,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:27:07,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:27:07,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... [2019-01-12 08:27:07,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:27:07,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:27:07,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:27:07,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:27:07,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:27:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 08:27:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-01-12 08:27:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 08:27:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:27:07,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:27:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-01-12 08:27:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 08:27:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 08:27:10,551 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 08:27:10,824 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:27:10,824 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:27:10,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:27:10 BoogieIcfgContainer [2019-01-12 08:27:10,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:27:10,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:27:10,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:27:10,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:27:10,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:27:07" (1/3) ... [2019-01-12 08:27:10,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d37b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:27:10, skipping insertion in model container [2019-01-12 08:27:10,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:27:07" (2/3) ... [2019-01-12 08:27:10,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d37b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:27:10, skipping insertion in model container [2019-01-12 08:27:10,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:27:10" (3/3) ... [2019-01-12 08:27:10,835 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2019-01-12 08:27:10,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:27:10,854 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:27:10,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:27:10,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:27:10,904 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:27:10,905 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:27:10,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:27:10,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:27:10,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:27:10,906 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:27:10,906 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:27:10,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:27:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 08:27:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 08:27:10,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:27:10,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:27:10,931 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:27:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:27:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2137295023, now seen corresponding path program 1 times [2019-01-12 08:27:10,940 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:27:10,941 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 08:27:10,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:27:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:27:13,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:27:13,969 WARN L181 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 08:27:16,131 WARN L838 $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)) (= ((_ 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)))))) c_ULTIMATE.start_main_~main__r~0)))) is different from false [2019-01-12 08:27:18,253 WARN L860 $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)) (= ((_ 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)))))) c_ULTIMATE.start_main_~main__r~0)))) is different from true [2019-01-12 08:27:24,672 WARN L838 $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 [2019-01-12 08:27:26,801 WARN L860 $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 [2019-01-12 08:27:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:27:39,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:27:39,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:27:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 08:27:39,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 08:27:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 08:27:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2019-01-12 08:27:39,781 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2019-01-12 08:27:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:27:42,653 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-12 08:27:42,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 08:27:42,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-12 08:27:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:27:42,801 INFO L225 Difference]: With dead ends: 29 [2019-01-12 08:27:42,801 INFO L226 Difference]: Without dead ends: 12 [2019-01-12 08:27:42,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2019-01-12 08:27:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-12 08:27:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-12 08:27:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 08:27:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-12 08:27:42,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-12 08:27:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:27:42,837 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-12 08:27:42,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 08:27:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-12 08:27:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 08:27:42,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:27:42,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:27:42,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:27:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:27:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2019-01-12 08:27:42,841 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:27:42,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 08:27:42,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:27:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:27:43,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:27:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:27:43,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:27:43,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:27:43,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:27:43,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:27:43,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:27:43,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:27:43,557 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-01-12 08:27:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:27:46,130 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-01-12 08:27:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 08:27:46,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-12 08:27:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:27:46,132 INFO L225 Difference]: With dead ends: 16 [2019-01-12 08:27:46,132 INFO L226 Difference]: Without dead ends: 12 [2019-01-12 08:27:46,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:27:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-12 08:27:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-12 08:27:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 08:27:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2019-01-12 08:27:46,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 10 [2019-01-12 08:27:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:27:46,138 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2019-01-12 08:27:46,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:27:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2019-01-12 08:27:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 08:27:46,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:27:46,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:27:46,140 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:27:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:27:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1946484073, now seen corresponding path program 1 times [2019-01-12 08:27:46,142 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:27:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 08:27:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 08:27:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:27:48,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:27:49,343 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 08:27:51,488 WARN L838 $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))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.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)))))) c_ULTIMATE.start_main_~main__r~0)))) is different from false [2019-01-12 08:27:53,614 WARN L860 $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))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.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)))))) c_ULTIMATE.start_main_~main__r~0)))) is different from true [2019-01-12 08:27:55,758 WARN L838 $PredicateComparison]: unable to prove that (and (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))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.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)))))) c_ULTIMATE.start_main_~main__r~0)))) (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53))) is different from false [2019-01-12 08:27:58,778 WARN L860 $PredicateComparison]: unable to prove that (and (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))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.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)))))) c_ULTIMATE.start_main_~main__r~0)))) (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53))) is different from true [2019-01-12 08:28:05,244 WARN L838 $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 [2019-01-12 08:28:07,396 WARN L860 $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 [2019-01-12 08:28:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:28:20,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:28:20,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:28:20,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 08:28:20,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 08:28:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 08:28:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2019-01-12 08:28:20,330 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 7 states. [2019-01-12 08:28:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:28:23,078 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2019-01-12 08:28:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 08:28:23,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-12 08:28:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:28:23,215 INFO L225 Difference]: With dead ends: 12 [2019-01-12 08:28:23,215 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 08:28:23,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2019-01-12 08:28:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 08:28:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 08:28:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 08:28:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 08:28:23,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-12 08:28:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:28:23,217 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 08:28:23,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 08:28:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 08:28:23,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 08:28:23,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 08:28:37,618 WARN L181 SmtUtils]: Spent 14.35 s on a formula simplification that was a NOOP. DAG size: 74 [2019-01-12 08:28:56,210 WARN L181 SmtUtils]: Spent 18.59 s on a formula simplification that was a NOOP. DAG size: 79 [2019-01-12 08:28:56,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 08:28:56,218 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 80) no Hoare annotation was computed. [2019-01-12 08:28:56,219 INFO L451 ceAbstractionStarter]: At program point L89(lines 14 91) the Hoare annotation is: true [2019-01-12 08:28:56,219 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 08:28:56,219 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 61) no Hoare annotation was computed. [2019-01-12 08:28:56,220 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))))))) [2019-01-12 08:28:56,220 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 08:28:56,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 08:28:56,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 08:28:56,220 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 85) no Hoare annotation was computed. [2019-01-12 08:28:56,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-01-12 08:28:56,221 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 90) no Hoare annotation was computed. [2019-01-12 08:28:56,221 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 69) no Hoare annotation was computed. [2019-01-12 08:28:56,221 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 74) no Hoare annotation was computed. [2019-01-12 08:28:56,222 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))))))) (= (bvadd ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 (_ bv4294967295 32)) (_ bv0 32)) (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))))))) [2019-01-12 08:28:56,229 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) [2019-01-12 08:28:56,238 INFO L168 Benchmark]: Toolchain (without parser) took 109047.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -76.4 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:28:56,240 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:28:56,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:28:56,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:28:56,244 INFO L168 Benchmark]: Boogie Preprocessor took 99.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:28:56,245 INFO L168 Benchmark]: RCFGBuilder took 3193.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:28:56,247 INFO L168 Benchmark]: TraceAbstraction took 105404.36 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: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-01-12 08:28:56,253 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 54.25 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3193.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105404.36 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: 70.1 MB). Peak memory consumption was 70.1 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 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - 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...