/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ................................................................................................................................................................................................................................................................................................................................................................................................ 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:05:17,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:05:17,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:05:17,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:05:17,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:05:17,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:05:17,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:05:17,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:05:17,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:05:17,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:05:17,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:05:17,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:05:17,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:05:17,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:05:17,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:05:17,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:05:17,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:05:17,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:05:17,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:05:17,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:05:17,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:05:17,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:05:17,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:05:17,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:05:17,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:05:17,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:05:17,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:05:17,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:05:17,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:05:17,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:05:17,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:05:17,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:05:17,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:05:17,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:05:17,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:05:17,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:05:17,475 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:05:17,491 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:05:17,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:05:17,492 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:05:17,492 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:05:17,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:05:17,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:05:17,493 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:05:17,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:05:17,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:05:17,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:05:17,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:05:17,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:05:17,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:05:17,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:05:17,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:05:17,495 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:05:17,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:05:17,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:05:17,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:05:17,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:05:17,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:05:17,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:05:17,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:17,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:05:17,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:05:17,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:05:17,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:05:17,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:05:17,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:05:17,498 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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2018-09-20 15:05:17,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:05:17,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:05:17,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:05:17,592 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:05:17,594 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:05:17,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-09-20 15:05:17,993 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399521c6c/ebd1ac914b164d448462ff90b5f488ae/FLAG7021c0eb2 [2018-09-20 15:05:18,235 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:05:18,237 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-09-20 15:05:18,251 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399521c6c/ebd1ac914b164d448462ff90b5f488ae/FLAG7021c0eb2 [2018-09-20 15:05:18,280 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399521c6c/ebd1ac914b164d448462ff90b5f488ae [2018-09-20 15:05:18,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:05:18,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:05:18,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:18,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:05:18,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:05:18,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319c8fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18, skipping insertion in model container [2018-09-20 15:05:18,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,324 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:05:18,631 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:18,659 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:05:18,695 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:18,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18 WrapperNode [2018-09-20 15:05:18,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:18,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:05:18,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:05:18,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:05:18,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (1/1) ... [2018-09-20 15:05:18,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:05:18,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:05:18,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:05:18,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:05:18,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (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 [2018-09-20 15:05:19,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:05:19,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:05:19,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:05:19,052 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-09-20 15:05:19,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-20 15:05:19,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:05:19,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:05:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:05:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:05:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:05:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:05:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-20 15:05:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:05:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:05:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:05:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:05:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:05:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:05:20,362 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:05:20,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:20 BoogieIcfgContainer [2018-09-20 15:05:20,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:05:20,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:05:20,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:05:20,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:05:20,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:05:18" (1/3) ... [2018-09-20 15:05:20,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ccfe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:20, skipping insertion in model container [2018-09-20 15:05:20,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:18" (2/3) ... [2018-09-20 15:05:20,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ccfe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:20, skipping insertion in model container [2018-09-20 15:05:20,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:20" (3/3) ... [2018-09-20 15:05:20,377 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b_true-unreach-call.c [2018-09-20 15:05:20,388 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:05:20,401 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:05:20,466 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:05:20,467 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:05:20,467 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:05:20,467 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:05:20,467 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:05:20,467 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:05:20,468 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:05:20,468 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:05:20,468 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:05:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-09-20 15:05:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-20 15:05:20,505 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:20,506 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:20,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -815238136, now seen corresponding path program 1 times [2018-09-20 15:05:20,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:20,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:20,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:20,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:20,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:05:20,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:05:20,713 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:05:20,714 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:20,717 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2018-09-20 15:05:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:20,764 INFO L93 Difference]: Finished difference Result 371 states and 435 transitions. [2018-09-20 15:05:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:05:20,765 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-09-20 15:05:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:20,781 INFO L225 Difference]: With dead ends: 371 [2018-09-20 15:05:20,781 INFO L226 Difference]: Without dead ends: 184 [2018-09-20 15:05:20,786 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-20 15:05:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-20 15:05:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-20 15:05:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 190 transitions. [2018-09-20 15:05:20,848 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 190 transitions. Word has length 31 [2018-09-20 15:05:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:20,849 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 190 transitions. [2018-09-20 15:05:20,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:05:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2018-09-20 15:05:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-20 15:05:20,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:20,860 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:20,860 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2015285196, now seen corresponding path program 1 times [2018-09-20 15:05:20,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:20,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:20,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:20,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:20,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:21,065 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:21,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 15:05:21,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 15:05:21,071 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 15:05:21,073 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:05:21,074 INFO L87 Difference]: Start difference. First operand 184 states and 190 transitions. Second operand 3 states. [2018-09-20 15:05:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:21,157 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-09-20 15:05:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 15:05:21,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-20 15:05:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:21,162 INFO L225 Difference]: With dead ends: 187 [2018-09-20 15:05:21,162 INFO L226 Difference]: Without dead ends: 184 [2018-09-20 15:05:21,164 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:05:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-20 15:05:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-20 15:05:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-20 15:05:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 189 transitions. [2018-09-20 15:05:21,182 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 189 transitions. Word has length 66 [2018-09-20 15:05:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:21,183 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 189 transitions. [2018-09-20 15:05:21,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 15:05:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 189 transitions. [2018-09-20 15:05:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-20 15:05:21,192 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:21,192 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:21,192 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 330775915, now seen corresponding path program 1 times [2018-09-20 15:05:21,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:21,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:21,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:21,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:21,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:05:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:05:21,414 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:05:21,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:05:21 BoogieIcfgContainer [2018-09-20 15:05:21,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:05:21,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:05:21,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:05:21,499 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:05:21,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:20" (3/4) ... [2018-09-20 15:05:21,505 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:05:21,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:05:21,506 INFO L168 Benchmark]: Toolchain (without parser) took 3220.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -86.2 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:21,508 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:21,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:21,509 INFO L168 Benchmark]: Boogie Preprocessor took 73.33 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:21,510 INFO L168 Benchmark]: RCFGBuilder took 1533.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:21,511 INFO L168 Benchmark]: TraceAbstraction took 1132.81 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: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:21,512 INFO L168 Benchmark]: Witness Printer took 6.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:21,516 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 460.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.33 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1533.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1132.81 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: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [\old(one_modf)=10737418243, one_modf=1] [L144] double x = -1.0 / 0.0; VAL [one_modf=1] [L145] FCALL double iptr = __VERIFIER_nondet_double(); VAL [iptr={10737418246:0}, one_modf=1] [L145] FCALL double iptr = __VERIFIER_nondet_double(); VAL [__VERIFIER_nondet_double()=10737418245, iptr={10737418246:0}, one_modf=1] [L146] CALL, EXPR modf_double(x, &iptr) VAL [\old(x)=10737418250, iptr={10737418246:0}, one_modf=1] [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [\old(x)=10737418250, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L24] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=10737418250, ew_u={10737418242:0}, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L25] FCALL ew_u.value = (x) VAL [\old(x)=10737418250, ew_u={10737418242:0}, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L26] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=10737418250, ew_u={10737418242:0}, ew_u.parts.msw=3, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L26] (i0) = ew_u.parts.msw VAL [\old(x)=10737418250, ew_u={10737418242:0}, ew_u.parts.msw=3, i0=3, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L26] FCALL (i0) = ew_u.parts.msw VAL [(i0) = ew_u.parts.msw=10737418252, \old(x)=10737418250, ew_u={10737418242:0}, ew_u.parts.msw=3, i0=3, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L27] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=10737418250, ew_u={10737418242:0}, ew_u.parts.lsw=6442450943, i0=3, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L27] (i1) = ew_u.parts.lsw VAL [\old(x)=10737418250, ew_u={10737418242:0}, ew_u.parts.lsw=6442450943, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L27] FCALL (i1) = ew_u.parts.lsw VAL [(i1) = ew_u.parts.lsw=10737418251, \old(x)=10737418250, ew_u={10737418242:0}, ew_u.parts.lsw=6442450943, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L28] COND FALSE !(0) VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, one_modf=1, x=10737418250] [L30] COND TRUE j0 < 20 VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, j0=-1, one_modf=1, x=10737418250] [L31] COND TRUE j0 < 0 VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, j0=-1, one_modf=1, x=10737418250] [L33] FCALL ieee_double_shape_type iw_u; VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, iw_u={10737418254:0}, j0=-1, one_modf=1, x=10737418250] [L34] FCALL iw_u.parts.msw = (i0 & 0x80000000) VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, iw_u={10737418254:0}, j0=-1, one_modf=1, x=10737418250] [L35] FCALL iw_u.parts.lsw = (0) VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, iw_u={10737418254:0}, j0=-1, one_modf=1, x=10737418250] [L36] EXPR, FCALL iw_u.value VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, iw_u={10737418254:0}, iw_u.value=10737418248, j0=-1, one_modf=1, x=10737418250] [L36] FCALL (*iptr) = iw_u.value VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, iw_u={10737418254:0}, iw_u.value=10737418248, j0=-1, one_modf=1, x=10737418250] [L37] COND FALSE !(0) VAL [\old(x)=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, j0=-1, one_modf=1, x=10737418250] [L38] RET return x; VAL [\old(x)=10737418250, \result=10737418250, i0=3, i1=2147483647, iptr={10737418246:0}, iptr={10737418246:0}, j0=-1, one_modf=1, x=10737418250] [L146] EXPR modf_double(x, &iptr) VAL [iptr={10737418246:0}, modf_double(x, &iptr)=10737418250, one_modf=1, x=10737418250] [L146] double res = modf_double(x, &iptr); [L149] EXPR, FCALL \read(iptr) VAL [\read(iptr)=10737418248, iptr={10737418246:0}, one_modf=1, res=10737418250, x=10737418250] [L149] CALL, EXPR isinf_double(iptr) VAL [\old(x)=10737418248, one_modf=1] [L112] __int32_t hx, lx; VAL [\old(x)=10737418248, one_modf=1, x=10737418248] [L114] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=10737418248, ew_u={10737418255:0}, one_modf=1, x=10737418248] [L115] FCALL ew_u.value = (x) VAL [\old(x)=10737418248, ew_u={10737418255:0}, one_modf=1, x=10737418248] [L116] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=10737418248, ew_u={10737418255:0}, ew_u.parts.msw=6442450944, one_modf=1, x=10737418248] [L116] (hx) = ew_u.parts.msw VAL [\old(x)=10737418248, ew_u={10737418255:0}, ew_u.parts.msw=6442450944, hx=-2147483648, one_modf=1, x=10737418248] [L116] FCALL (hx) = ew_u.parts.msw VAL [(hx) = ew_u.parts.msw=10737418247, \old(x)=10737418248, ew_u={10737418255:0}, ew_u.parts.msw=6442450944, hx=-2147483648, one_modf=1, x=10737418248] [L117] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=10737418248, ew_u={10737418255:0}, ew_u.parts.lsw=10737418240, hx=-2147483648, one_modf=1, x=10737418248] [L117] (lx) = ew_u.parts.lsw VAL [\old(x)=10737418248, ew_u={10737418255:0}, ew_u.parts.lsw=10737418240, hx=-2147483648, lx=-2147483648, one_modf=1, x=10737418248] [L117] FCALL (lx) = ew_u.parts.lsw VAL [(lx) = ew_u.parts.lsw=10737418249, \old(x)=10737418248, ew_u={10737418255:0}, ew_u.parts.lsw=10737418240, hx=-2147483648, lx=-2147483648, one_modf=1, x=10737418248] [L118] COND FALSE !(0) VAL [\old(x)=10737418248, hx=-2147483648, lx=-2147483648, one_modf=1, x=10737418248] [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] RET return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=10737418248, \result=1, hx=2146435072, lx=-2147483648, one_modf=1, x=10737418248] [L149] EXPR isinf_double(iptr) VAL [\read(iptr)=10737418248, iptr={10737418246:0}, isinf_double(iptr)=1, one_modf=1, res=10737418250, x=10737418250] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [\read(iptr)=10737418248, iptr={10737418246:0}, isinf_double(iptr)=1, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=10737418250, x=10737418250] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L149] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [\read(iptr)=10737418248, iptr={10737418246:0}, isinf_double(iptr)=1, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=10737418250, res == -0.0 && __signbit_double(res) == 1=0, x=10737418250] [L149] COND FALSE, EXPR !(res == -0.0 && __signbit_double(res) == 1) VAL [\read(iptr)=10737418248, iptr={10737418246:0}, isinf_double(iptr)=1, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=10737418250, res == -0.0 && __signbit_double(res) == 1=0, x=10737418250] [L149] isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) VAL [\read(iptr)=10737418248, iptr={10737418246:0}, isinf_double(iptr)=1, isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1)=1, one_modf=1, res=10737418250, res == -0.0 && __signbit_double(res) == 1=0, x=10737418250] [L149] COND TRUE isinf_double(iptr) && !(res == -0.0 && __signbit_double(res) == 1) [L150] __VERIFIER_error() VAL [iptr={10737418246:0}, one_modf=1, res=10737418250, x=10737418250] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 195 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 386 SDtfs, 0 SDslu, 185 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 5190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:05:24,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:05:24,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:05:24,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:05:24,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:05:24,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:05:24,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:05:24,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:05:24,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:05:24,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:05:24,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:05:24,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:05:24,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:05:24,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:05:24,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:05:24,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:05:24,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:05:24,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:05:24,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:05:24,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:05:24,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:05:24,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:05:24,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:05:24,148 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:05:24,148 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:05:24,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:05:24,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:05:24,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:05:24,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:05:24,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:05:24,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:05:24,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:05:24,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:05:24,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:05:24,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:05:24,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:05:24,165 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:05:24,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:05:24,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:05:24,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:05:24,195 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:05:24,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:05:24,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:05:24,197 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:05:24,197 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:05:24,197 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:05:24,197 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:05:24,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:05:24,198 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:05:24,198 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:05:24,198 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:05:24,198 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:05:24,198 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:05:24,198 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:05:24,199 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:05:24,199 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:05:24,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:05:24,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:05:24,201 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:05:24,201 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:05:24,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:24,201 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:05:24,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:05:24,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:05:24,202 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:05:24,202 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:05:24,203 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:05:24,203 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:05:24,204 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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2018-09-20 15:05:24,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:05:24,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:05:24,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:05:24,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:05:24,290 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:05:24,291 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-09-20 15:05:24,642 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688e659d9/aaca747b6b5c4826ad801cbab0c5133a/FLAG99f6a7275 [2018-09-20 15:05:24,790 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:05:24,790 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1211b_true-unreach-call.c [2018-09-20 15:05:24,798 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688e659d9/aaca747b6b5c4826ad801cbab0c5133a/FLAG99f6a7275 [2018-09-20 15:05:24,813 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688e659d9/aaca747b6b5c4826ad801cbab0c5133a [2018-09-20 15:05:24,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:05:24,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:05:24,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:24,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:05:24,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:05:24,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:24" (1/1) ... [2018-09-20 15:05:24,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ab98c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:24, skipping insertion in model container [2018-09-20 15:05:24,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:24" (1/1) ... [2018-09-20 15:05:24,845 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:05:25,163 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:25,207 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:05:25,263 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:25,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25 WrapperNode [2018-09-20 15:05:25,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:25,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:05:25,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:05:25,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:05:25,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (1/1) ... [2018-09-20 15:05:25,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:05:25,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:05:25,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:05:25,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:05:25,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (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 [2018-09-20 15:05:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-09-20 15:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-20 15:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:05:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:05:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:05:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:05:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-09-20 15:05:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:05:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:05:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:05:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:05:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:05:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:05:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:05:25,859 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:25,890 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:25,912 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:25,974 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:25,993 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,101 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,208 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,230 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,241 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,462 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,619 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,646 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,688 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,720 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,740 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,752 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,775 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:26,854 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:27,416 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:27,435 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:27,444 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:27,473 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:05:27,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:27 BoogieIcfgContainer [2018-09-20 15:05:27,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:05:27,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:05:27,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:05:27,479 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:05:27,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:05:24" (1/3) ... [2018-09-20 15:05:27,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cb3c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:27, skipping insertion in model container [2018-09-20 15:05:27,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:25" (2/3) ... [2018-09-20 15:05:27,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cb3c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:27, skipping insertion in model container [2018-09-20 15:05:27,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:27" (3/3) ... [2018-09-20 15:05:27,484 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b_true-unreach-call.c [2018-09-20 15:05:27,491 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:05:27,499 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:05:27,545 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:05:27,546 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:05:27,546 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:05:27,546 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:05:27,547 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:05:27,547 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:05:27,547 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:05:27,548 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:05:27,548 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:05:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-09-20 15:05:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-20 15:05:27,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:27,597 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:27,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash -815238136, now seen corresponding path program 1 times [2018-09-20 15:05:27,609 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:27,609 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 [2018-09-20 15:05:27,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:27,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:27,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:27,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:27,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:05:27,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:05:27,771 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:05:27,772 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:27,775 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2018-09-20 15:05:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:27,838 INFO L93 Difference]: Finished difference Result 371 states and 435 transitions. [2018-09-20 15:05:27,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:05:27,840 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-09-20 15:05:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:27,863 INFO L225 Difference]: With dead ends: 371 [2018-09-20 15:05:27,863 INFO L226 Difference]: Without dead ends: 184 [2018-09-20 15:05:27,871 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-20 15:05:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-20 15:05:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-20 15:05:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 190 transitions. [2018-09-20 15:05:27,965 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 190 transitions. Word has length 31 [2018-09-20 15:05:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:27,969 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 190 transitions. [2018-09-20 15:05:27,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:05:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 190 transitions. [2018-09-20 15:05:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-20 15:05:27,978 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:27,978 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:27,979 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2015285196, now seen corresponding path program 1 times [2018-09-20 15:05:27,982 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:27,984 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 [2018-09-20 15:05:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:28,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:28,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:05:28,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:05:28,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:28,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:28,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:28,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:05:28,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:05:28,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:05:28,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:28,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:28,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:28,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:05:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:28,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:28,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:28,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:05:28,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:05:28,972 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:05:28,973 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:05:28,973 INFO L87 Difference]: Start difference. First operand 184 states and 190 transitions. Second operand 9 states. [2018-09-20 15:05:30,872 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 15:05:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:38,806 INFO L93 Difference]: Finished difference Result 234 states and 241 transitions. [2018-09-20 15:05:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:05:38,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-09-20 15:05:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:38,814 INFO L225 Difference]: With dead ends: 234 [2018-09-20 15:05:38,814 INFO L226 Difference]: Without dead ends: 137 [2018-09-20 15:05:38,817 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:05:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-20 15:05:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-09-20 15:05:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-20 15:05:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2018-09-20 15:05:38,833 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 66 [2018-09-20 15:05:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:38,834 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2018-09-20 15:05:38,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:05:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2018-09-20 15:05:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-20 15:05:38,837 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:38,838 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:38,838 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:38,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1820862949, now seen corresponding path program 1 times [2018-09-20 15:05:38,839 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:38,840 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:38,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:39,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:05:39,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:05:39,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:39,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:39,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:39,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:05:39,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:05:39,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:05:39,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:39,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:39,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:39,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:05:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:39,621 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:39,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:39,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:05:39,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:05:39,639 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:05:39,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:05:39,639 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 9 states. [2018-09-20 15:05:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:50,071 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-09-20 15:05:50,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:05:50,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-09-20 15:05:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:50,075 INFO L225 Difference]: With dead ends: 183 [2018-09-20 15:05:50,075 INFO L226 Difference]: Without dead ends: 98 [2018-09-20 15:05:50,076 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:05:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-20 15:05:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-20 15:05:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-20 15:05:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-09-20 15:05:50,098 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 68 [2018-09-20 15:05:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:50,099 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-09-20 15:05:50,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:05:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-09-20 15:05:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-20 15:05:50,109 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:50,110 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:50,110 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash 613236977, now seen corresponding path program 1 times [2018-09-20 15:05:50,111 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:50,111 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:50,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:50,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:50,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:50,578 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:50,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 15:05:50,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 15:05:50,579 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 15:05:50,579 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:05:50,579 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 3 states. [2018-09-20 15:05:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:50,595 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-20 15:05:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 15:05:50,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-09-20 15:05:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:50,600 INFO L225 Difference]: With dead ends: 101 [2018-09-20 15:05:50,600 INFO L226 Difference]: Without dead ends: 98 [2018-09-20 15:05:50,601 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:05:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-20 15:05:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-20 15:05:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-20 15:05:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-20 15:05:50,612 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 79 [2018-09-20 15:05:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:50,612 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-20 15:05:50,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 15:05:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-20 15:05:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-20 15:05:50,615 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:50,615 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:50,615 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash 899814120, now seen corresponding path program 1 times [2018-09-20 15:05:50,617 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:50,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:51,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:51,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-09-20 15:05:51,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-20 15:05:51,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:51,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:51,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:51,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-09-20 15:05:51,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-09-20 15:05:51,239 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:51,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-09-20 15:05:51,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:51,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:51,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:51,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:05:51,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-09-20 15:05:51,375 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:51,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2018-09-20 15:05:51,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:51,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:51,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:51,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:21 [2018-09-20 15:05:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:51,740 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:51,755 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:51,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:05:51,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:05:51,756 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:05:51,756 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:05:51,756 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 10 states. [2018-09-20 15:05:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:53,073 INFO L93 Difference]: Finished difference Result 102 states and 101 transitions. [2018-09-20 15:05:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:05:53,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-09-20 15:05:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:53,076 INFO L225 Difference]: With dead ends: 102 [2018-09-20 15:05:53,076 INFO L226 Difference]: Without dead ends: 98 [2018-09-20 15:05:53,076 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:05:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-20 15:05:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-20 15:05:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-20 15:05:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 97 transitions. [2018-09-20 15:05:53,093 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 97 transitions. Word has length 81 [2018-09-20 15:05:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:53,094 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 97 transitions. [2018-09-20 15:05:53,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:05:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 97 transitions. [2018-09-20 15:05:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-20 15:05:53,095 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:53,095 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:53,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash 422042458, now seen corresponding path program 1 times [2018-09-20 15:05:53,097 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:53,097 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:53,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:53,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:53,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:05:53,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:05:53,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:53,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:53,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:53,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:05:53,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:05:53,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:05:53,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:53,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:53,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:53,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:05:53,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-09-20 15:05:53,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-09-20 15:05:53,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:54,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:54,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:54,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-20 15:05:54,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-09-20 15:05:54,357 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:54,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-09-20 15:05:54,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:54,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:54,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:54,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-09-20 15:05:54,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-09-20 15:05:54,958 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:54,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2018-09-20 15:05:54,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:55,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:55,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:55,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:34 [2018-09-20 15:05:56,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:05:56,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:05:56,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:56,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:05:56,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:05:56,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:05:56,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:56,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:05:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:57,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:57,052 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:57,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:05:57,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:05:57,053 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:05:57,054 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:05:57,054 INFO L87 Difference]: Start difference. First operand 98 states and 97 transitions. Second operand 22 states. [2018-09-20 15:06:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:28,204 INFO L93 Difference]: Finished difference Result 98 states and 97 transitions. [2018-09-20 15:06:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-20 15:06:28,204 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-09-20 15:06:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:28,205 INFO L225 Difference]: With dead ends: 98 [2018-09-20 15:06:28,205 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:06:28,208 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2018-09-20 15:06:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:06:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:06:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:06:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:06:28,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-09-20 15:06:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:28,209 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:06:28,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:06:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:06:28,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:06:28,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:06:28,609 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2018-09-20 15:06:29,149 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2018-09-20 15:06:29,231 INFO L426 ceAbstractionStarter]: For program point isnan_doubleENTRY(line 16) no Hoare annotation was computed. [2018-09-20 15:06:29,232 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-09-20 15:06:29,232 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-09-20 15:06:29,232 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:06:29,232 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:06:29,232 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:06:29,232 INFO L426 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L116-1(line 116) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L116-2(line 116) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L114-1(line 114) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L114-2(line 114) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L114-3(line 114) no Hoare annotation was computed. [2018-09-20 15:06:29,233 INFO L426 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-09-20 15:06:29,234 INFO L426 ceAbstractionStarter]: For program point L117-1(line 117) no Hoare annotation was computed. [2018-09-20 15:06:29,235 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-20 15:06:29,235 INFO L426 ceAbstractionStarter]: For program point L117-2(line 117) no Hoare annotation was computed. [2018-09-20 15:06:29,235 INFO L426 ceAbstractionStarter]: For program point L117-3(line 117) no Hoare annotation was computed. [2018-09-20 15:06:29,235 INFO L426 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2018-09-20 15:06:29,235 INFO L426 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 111 123) no Hoare annotation was computed. [2018-09-20 15:06:29,235 INFO L429 ceAbstractionStarter]: At program point L113-3(lines 113 118) the Hoare annotation is: true [2018-09-20 15:06:29,236 INFO L426 ceAbstractionStarter]: For program point L113-4(lines 113 118) no Hoare annotation was computed. [2018-09-20 15:06:29,236 INFO L426 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 111 123) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L429 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 111 123) the Hoare annotation is: true [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L131-2(line 131) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L129-1(line 129) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L129-2(line 129) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L129-3(line 129) no Hoare annotation was computed. [2018-09-20 15:06:29,237 INFO L422 ceAbstractionStarter]: At program point L128-3(lines 128 132) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-20 15:06:29,237 INFO L426 ceAbstractionStarter]: For program point L128-4(lines 128 132) no Hoare annotation was computed. [2018-09-20 15:06:29,238 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 125 135) no Hoare annotation was computed. [2018-09-20 15:06:29,238 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 125 135) no Hoare annotation was computed. [2018-09-20 15:06:29,238 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 125 135) the Hoare annotation is: true [2018-09-20 15:06:29,238 INFO L426 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2018-09-20 15:06:29,238 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-20 15:06:29,238 INFO L426 ceAbstractionStarter]: For program point L131-1(line 131) no Hoare annotation was computed. [2018-09-20 15:06:29,241 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:06:29,241 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:06:29,241 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:06:29,241 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:06:29,241 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 137 155) no Hoare annotation was computed. [2018-09-20 15:06:29,242 INFO L426 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-09-20 15:06:29,242 INFO L422 ceAbstractionStarter]: At program point L149-1(line 149) the Hoare annotation is: (and (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) main_~x~0) (exists ((|v_q#valueAsBitvector_24| (_ BitVec 64))) (and (= (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_24|) (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0) (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_24|) ((_ extract 62 52) |v_q#valueAsBitvector_24|) ((_ extract 51 0) |v_q#valueAsBitvector_24|)))))) [2018-09-20 15:06:29,242 INFO L426 ceAbstractionStarter]: For program point L149-2(line 149) no Hoare annotation was computed. [2018-09-20 15:06:29,242 INFO L426 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2018-09-20 15:06:29,242 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,242 INFO L426 ceAbstractionStarter]: For program point L149-4(line 149) no Hoare annotation was computed. [2018-09-20 15:06:29,242 INFO L426 ceAbstractionStarter]: For program point L145-1(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L422 ceAbstractionStarter]: At program point L149-5(line 149) the Hoare annotation is: (and (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) main_~x~0) (exists ((|v_q#valueAsBitvector_24| (_ BitVec 64))) (and (= (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_24|) (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0) (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_24|) ((_ extract 62 52) |v_q#valueAsBitvector_24|) ((_ extract 51 0) |v_q#valueAsBitvector_24|))))) |main_#t~short32|) [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point L145-2(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point L149-6(line 149) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point L145-3(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point L149-8(line 149) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point L145-4(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 137 155) no Hoare annotation was computed. [2018-09-20 15:06:29,243 INFO L426 ceAbstractionStarter]: For program point L145-5(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,244 INFO L426 ceAbstractionStarter]: For program point L149-10(lines 149 152) no Hoare annotation was computed. [2018-09-20 15:06:29,244 INFO L426 ceAbstractionStarter]: For program point L145-6(line 145) no Hoare annotation was computed. [2018-09-20 15:06:29,244 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-09-20 15:06:29,244 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 137 155) the Hoare annotation is: true [2018-09-20 15:06:29,244 INFO L426 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-09-20 15:06:29,244 INFO L422 ceAbstractionStarter]: At program point L146(line 146) the Hoare annotation is: (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) main_~x~0) [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L146-1(line 146) no Hoare annotation was computed. [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 73) no Hoare annotation was computed. [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-20 15:06:29,245 INFO L426 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-09-20 15:06:29,246 INFO L422 ceAbstractionStarter]: At program point L69-2(lines 68 73) the Hoare annotation is: (and (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_23|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) modf_double_~j0~0) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))))) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))) (= modf_double_~i0~0 ((_ extract 63 32) |v_q#valueAsBitvector_23|))))) [2018-09-20 15:06:29,246 INFO L426 ceAbstractionStarter]: For program point L86(lines 86 90) no Hoare annotation was computed. [2018-09-20 15:06:29,246 INFO L426 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-09-20 15:06:29,246 INFO L426 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L422 ceAbstractionStarter]: At program point L86-2(lines 85 90) the Hoare annotation is: (and (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_23|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) modf_double_~j0~0) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))))) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))) (not (bvsgt (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_23|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) (_ bv51 32))))) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))) (= modf_double_~i0~0 ((_ extract 63 32) |v_q#valueAsBitvector_23|))))) [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L53-3(line 53) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L103-1(line 103) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L70-1(line 70) no Hoare annotation was computed. [2018-09-20 15:06:29,247 INFO L426 ceAbstractionStarter]: For program point L70-2(line 70) no Hoare annotation was computed. [2018-09-20 15:06:29,248 INFO L426 ceAbstractionStarter]: For program point L70-3(line 70) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L87-1(line 87) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L87-2(line 87) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L87-3(line 87) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-09-20 15:06:29,249 INFO L426 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L72-2(line 72) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L89-1(line 89) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L89-2(line 89) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L422 ceAbstractionStarter]: At program point L23-3(lines 23 28) the Hoare annotation is: (= |modf_double_#in~x| modf_double_~x) [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L23-4(lines 23 28) no Hoare annotation was computed. [2018-09-20 15:06:29,250 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-20 15:06:29,252 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2018-09-20 15:06:29,252 INFO L426 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-09-20 15:06:29,252 INFO L426 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-09-20 15:06:29,252 INFO L422 ceAbstractionStarter]: At program point L57-3(lines 57 62) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_22|) (_ bv20 32)) (_ bv2047 32))) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))))) (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_22|) modf_double_~i0~0) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))))) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (bvslt (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_22|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) (_ bv20 32)) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)))))) [2018-09-20 15:06:29,252 INFO L426 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-09-20 15:06:29,252 INFO L426 ceAbstractionStarter]: For program point L57-4(lines 57 62) no Hoare annotation was computed. [2018-09-20 15:06:29,252 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L74-2(lines 66 81) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L74-3(lines 74 79) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-20 15:06:29,253 INFO L426 ceAbstractionStarter]: For program point L58-1(line 58) no Hoare annotation was computed. [2018-09-20 15:06:29,258 INFO L426 ceAbstractionStarter]: For program point L91-2(lines 83 98) no Hoare annotation was computed. [2018-09-20 15:06:29,258 INFO L426 ceAbstractionStarter]: For program point L58-2(line 58) no Hoare annotation was computed. [2018-09-20 15:06:29,258 INFO L426 ceAbstractionStarter]: For program point L91-3(lines 91 96) no Hoare annotation was computed. [2018-09-20 15:06:29,258 INFO L426 ceAbstractionStarter]: For program point L58-3(line 58) no Hoare annotation was computed. [2018-09-20 15:06:29,258 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L75-1(line 75) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L75-2(line 75) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L75-3(line 75) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L92-1(line 92) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L92-2(line 92) no Hoare annotation was computed. [2018-09-20 15:06:29,259 INFO L426 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L92-3(line 92) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L429 ceAbstractionStarter]: At program point modf_doubleENTRY(lines 20 108) the Hoare annotation is: true [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-09-20 15:06:29,260 INFO L426 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-09-20 15:06:29,261 INFO L426 ceAbstractionStarter]: For program point L27-2(line 27) no Hoare annotation was computed. [2018-09-20 15:06:29,261 INFO L426 ceAbstractionStarter]: For program point L27-3(line 27) no Hoare annotation was computed. [2018-09-20 15:06:29,261 INFO L426 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2018-09-20 15:06:29,261 INFO L426 ceAbstractionStarter]: For program point L44(lines 44 48) no Hoare annotation was computed. [2018-09-20 15:06:29,261 INFO L422 ceAbstractionStarter]: At program point L44-2(lines 43 48) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_22|) (_ bv20 32)) (_ bv2047 32))) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))))) (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_22|) modf_double_~i0~0) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))))) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (bvslt (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_22|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) (_ bv20 32)) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)))))) [2018-09-20 15:06:29,262 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-20 15:06:29,262 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L61-1(line 61) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L78-1(line 78) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L45-1(line 45) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L78-2(line 78) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L45-2(line 45) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L78-3(line 78) no Hoare annotation was computed. [2018-09-20 15:06:29,263 INFO L426 ceAbstractionStarter]: For program point L45-3(line 45) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L95-1(line 95) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L95-2(line 95) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L95-3(line 95) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-09-20 15:06:29,264 INFO L426 ceAbstractionStarter]: For program point L47-1(line 47) no Hoare annotation was computed. [2018-09-20 15:06:29,265 INFO L426 ceAbstractionStarter]: For program point L47-2(line 47) no Hoare annotation was computed. [2018-09-20 15:06:29,265 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2018-09-20 15:06:29,265 INFO L426 ceAbstractionStarter]: For program point modf_doubleFINAL(lines 20 108) no Hoare annotation was computed. [2018-09-20 15:06:29,265 INFO L426 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-09-20 15:06:29,265 INFO L422 ceAbstractionStarter]: At program point L32-3(lines 32 37) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_22|) (_ bv20 32)) (_ bv2047 32))) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))))) (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_22|) modf_double_~i0~0) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|))))) (exists ((|v_q#valueAsBitvector_22| (_ BitVec 64))) (and (bvslt (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_22|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) (_ bv20 32)) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_22|) ((_ extract 62 52) |v_q#valueAsBitvector_22|) ((_ extract 51 0) |v_q#valueAsBitvector_22|)))))) [2018-09-20 15:06:29,265 INFO L426 ceAbstractionStarter]: For program point L32-4(lines 32 37) no Hoare annotation was computed. [2018-09-20 15:06:29,265 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2018-09-20 15:06:29,266 INFO L426 ceAbstractionStarter]: For program point L49-2(lines 41 56) no Hoare annotation was computed. [2018-09-20 15:06:29,266 INFO L426 ceAbstractionStarter]: For program point L49-3(lines 49 54) no Hoare annotation was computed. [2018-09-20 15:06:29,266 INFO L426 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2018-09-20 15:06:29,266 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2018-09-20 15:06:29,266 INFO L426 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-09-20 15:06:29,266 INFO L426 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-09-20 15:06:29,268 INFO L422 ceAbstractionStarter]: At program point L99-3(lines 99 104) the Hoare annotation is: (and (= |modf_double_#in~x| modf_double_~x) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_23|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) modf_double_~j0~0) (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))))) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))) (not (bvsgt (bvadd (bvand (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_23|) (_ bv20 32)) (_ bv2047 32)) (_ bv4294966273 32)) (_ bv51 32))))) (exists ((|v_q#valueAsBitvector_23| (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_23|) ((_ extract 62 52) |v_q#valueAsBitvector_23|) ((_ extract 51 0) |v_q#valueAsBitvector_23|))) (= modf_double_~i0~0 ((_ extract 63 32) |v_q#valueAsBitvector_23|))))) [2018-09-20 15:06:29,268 INFO L426 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-09-20 15:06:29,268 INFO L426 ceAbstractionStarter]: For program point L99-4(lines 99 104) no Hoare annotation was computed. [2018-09-20 15:06:29,268 INFO L426 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. [2018-09-20 15:06:29,268 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L50-3(line 50) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L100-1(line 100) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L100-2(line 100) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L100-3(line 100) no Hoare annotation was computed. [2018-09-20 15:06:29,269 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-20 15:06:29,270 INFO L426 ceAbstractionStarter]: For program point modf_doubleEXIT(lines 20 108) no Hoare annotation was computed. [2018-09-20 15:06:29,270 INFO L426 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-09-20 15:06:29,270 INFO L426 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-09-20 15:06:29,270 INFO L426 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-09-20 15:06:29,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,285 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,306 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,306 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,306 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,310 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,311 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,311 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,311 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,311 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,315 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,315 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,319 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,331 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,334 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,334 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,337 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,345 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,357 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,360 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,360 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,360 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,360 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,367 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,373 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,375 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,375 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,375 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,375 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:06:29 BoogieIcfgContainer [2018-09-20 15:06:29,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:06:29,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:06:29,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:06:29,401 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:06:29,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:27" (3/4) ... [2018-09-20 15:06:29,410 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:06:29,418 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-09-20 15:06:29,418 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:06:29,418 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-09-20 15:06:29,418 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-20 15:06:29,419 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:06:29,419 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure modf_double [2018-09-20 15:06:29,430 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2018-09-20 15:06:29,430 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-09-20 15:06:29,431 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-09-20 15:06:29,463 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:06:29,464 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:06:29,465 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_22 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_22 : bv64 :: v_q#valueAsBitvector_22[63:32] == i0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0]))) && (\exists v_q#valueAsBitvector_22 : bv64 :: ~bvslt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32), 4294966273bv32), 20bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) [2018-09-20 15:06:29,465 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_22 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_22 : bv64 :: v_q#valueAsBitvector_22[63:32] == i0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0]))) && (\exists v_q#valueAsBitvector_22 : bv64 :: ~bvslt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32), 4294966273bv32), 20bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) [2018-09-20 15:06:29,466 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x && (\exists v_q#valueAsBitvector_23 : bv64 :: ~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32) == j0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && i0 == v_q#valueAsBitvector_23[63:32]) [2018-09-20 15:06:29,466 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(x) == x && (\exists v_q#valueAsBitvector_23 : bv64 :: ~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32) == j0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && !~bvsgt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32), 51bv32))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && i0 == v_q#valueAsBitvector_23[63:32]) [2018-09-20 15:06:29,466 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_22 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_22 : bv64 :: v_q#valueAsBitvector_22[63:32] == i0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0]))) && (\exists v_q#valueAsBitvector_22 : bv64 :: ~bvslt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32), 4294966273bv32), 20bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) [2018-09-20 15:06:29,466 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(x) == x && (\exists v_q#valueAsBitvector_23 : bv64 :: ~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32) == j0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && !~bvsgt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32), 51bv32))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && i0 == v_q#valueAsBitvector_23[63:32]) [2018-09-20 15:06:29,533 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:06:29,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:06:29,534 INFO L168 Benchmark]: Toolchain (without parser) took 64716.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 951.9 MB in the beginning and 1.3 GB in the end (delta: -329.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:29,536 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:29,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:29,536 INFO L168 Benchmark]: Boogie Preprocessor took 73.69 ms. Allocated memory is still 1.0 GB. Free memory was 935.8 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:29,536 INFO L168 Benchmark]: RCFGBuilder took 2099.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:29,537 INFO L168 Benchmark]: TraceAbstraction took 61924.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.9 MB). Peak memory consumption was 356.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:29,537 INFO L168 Benchmark]: Witness Printer took 133.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:29,542 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.69 ms. Allocated memory is still 1.0 GB. Free memory was 935.8 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2099.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61924.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.9 MB). Peak memory consumption was 356.5 MB. Max. memory is 11.5 GB. * Witness Printer took 133.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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: 99]: Loop Invariant [2018-09-20 15:06:29,557 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,561 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,561 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,561 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,561 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,561 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,562 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,562 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,562 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,562 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,562 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,562 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,563 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,563 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] Derived loop invariant: ((\old(x) == x && (\exists v_q#valueAsBitvector_23 : bv64 :: ~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32) == j0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && !~bvsgt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32), 51bv32))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && i0 == v_q#valueAsBitvector_23[63:32]) - InvariantResult [Line: 57]: Loop Invariant [2018-09-20 15:06:29,571 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,571 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,571 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,571 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,573 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,573 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,578 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,578 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,578 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,578 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,578 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_22 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_22 : bv64 :: v_q#valueAsBitvector_22[63:32] == i0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0]))) && (\exists v_q#valueAsBitvector_22 : bv64 :: ~bvslt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32), 4294966273bv32), 20bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) - InvariantResult [Line: 32]: Loop Invariant [2018-09-20 15:06:29,582 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,582 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,589 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_22 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_22 : bv64 :: v_q#valueAsBitvector_22[63:32] == i0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0]))) && (\exists v_q#valueAsBitvector_22 : bv64 :: ~bvslt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32), 4294966273bv32), 20bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant [2018-09-20 15:06:29,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,594 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,595 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,595 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,595 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,599 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] Derived loop invariant: (\old(x) == x && (\exists v_q#valueAsBitvector_23 : bv64 :: ~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32) == j0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && i0 == v_q#valueAsBitvector_23[63:32]) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 85]: Loop Invariant [2018-09-20 15:06:29,600 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,601 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,601 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,601 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,601 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,601 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,604 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,605 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,609 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] [2018-09-20 15:06:29,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_23,QUANTIFIED] Derived loop invariant: ((\old(x) == x && (\exists v_q#valueAsBitvector_23 : bv64 :: ~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32) == j0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && !~bvsgt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_23[63:32], 20bv32), 2047bv32), 4294966273bv32), 51bv32))) && (\exists v_q#valueAsBitvector_23 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_23[63:63], v_q#valueAsBitvector_23[62:52], v_q#valueAsBitvector_23[51:0]) && i0 == v_q#valueAsBitvector_23[63:32]) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 43]: Loop Invariant [2018-09-20 15:06:29,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,614 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,615 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,616 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,617 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,617 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] [2018-09-20 15:06:29,617 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_22,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_22 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_22 : bv64 :: v_q#valueAsBitvector_22[63:32] == i0 && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0]))) && (\exists v_q#valueAsBitvector_22 : bv64 :: ~bvslt32(~bvadd64(~bvand32(~bvashr32(v_q#valueAsBitvector_22[63:32], 20bv32), 2047bv32), 4294966273bv32), 20bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_22[63:63], v_q#valueAsBitvector_22[62:52], v_q#valueAsBitvector_22[51:0])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 195 locations, 1 error locations. SAFE Result, 61.7s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 52.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 732 SDtfs, 711 SDslu, 3119 SDs, 0 SdLazy, 933 SolverSat, 43 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 45.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 31 PreInvPairs, 42 NumberOfFragments, 473 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 416 ConstructedInterpolants, 112 QuantifiedInterpolants, 236917 SizeOfPredicates, 44 NumberOfNonLiveVariables, 845 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...