./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_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 c8db64e82d1b178f8644abd34ffdb7278ee391d6 .................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_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 c8db64e82d1b178f8644abd34ffdb7278ee391d6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:49:08,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:49:08,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:49:08,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:49:08,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:49:08,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:49:08,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:49:08,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:49:08,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:49:08,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:49:08,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:49:08,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:49:08,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:49:08,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:49:08,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:49:08,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:49:08,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:49:08,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:49:08,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:49:08,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:49:08,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:49:08,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:49:08,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:49:08,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:49:08,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:49:08,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:49:08,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:49:08,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:49:08,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:49:08,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:49:08,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:49:08,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:49:08,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:49:08,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:49:08,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:49:08,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:49:08,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:49:08,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:49:08,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:49:08,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:49:08,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:49:08,112 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:49:08,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:49:08,113 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:49:08,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:49:08,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:49:08,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:49:08,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:49:08,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:49:08,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:49:08,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:49:08,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:49:08,114 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:49:08,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:49:08,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:49:08,115 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:49:08,115 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:49:08,115 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:49:08,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:49:08,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:49:08,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:49:08,116 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:49:08,116 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:49:08,116 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:49:08,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:49:08,117 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 -> c8db64e82d1b178f8644abd34ffdb7278ee391d6 [2018-12-31 03:49:08,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:49:08,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:49:08,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:49:08,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:49:08,180 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:49:08,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2018-12-31 03:49:08,246 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58e8d2f2/230a4aa04f5a430e95af2c0282a4deb0/FLAG4db71e7bb [2018-12-31 03:49:08,762 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:49:08,762 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2018-12-31 03:49:08,772 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58e8d2f2/230a4aa04f5a430e95af2c0282a4deb0/FLAG4db71e7bb [2018-12-31 03:49:09,104 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58e8d2f2/230a4aa04f5a430e95af2c0282a4deb0 [2018-12-31 03:49:09,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:49:09,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:49:09,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:09,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:49:09,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:49:09,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f54813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09, skipping insertion in model container [2018-12-31 03:49:09,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:49:09,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:49:09,467 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:09,478 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:49:09,544 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:09,571 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:49:09,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09 WrapperNode [2018-12-31 03:49:09,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:09,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:09,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:49:09,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:49:09,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:09,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:49:09,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:49:09,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:49:09,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (1/1) ... [2018-12-31 03:49:09,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:49:09,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:49:09,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:49:09,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:49:09,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (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-12-31 03:49:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:49:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:49:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:49:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:49:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:49:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:49:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:49:09,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:49:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:49:11,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:49:11,365 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-31 03:49:11,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:11 BoogieIcfgContainer [2018-12-31 03:49:11,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:49:11,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:49:11,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:49:11,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:49:11,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:49:09" (1/3) ... [2018-12-31 03:49:11,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dcf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:11, skipping insertion in model container [2018-12-31 03:49:11,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:09" (2/3) ... [2018-12-31 03:49:11,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dcf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:11, skipping insertion in model container [2018-12-31 03:49:11,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:11" (3/3) ... [2018-12-31 03:49:11,374 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a_true-unreach-call.c [2018-12-31 03:49:11,384 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:49:11,392 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:49:11,409 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:49:11,441 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:49:11,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:49:11,442 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:49:11,442 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:49:11,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:49:11,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:49:11,443 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:49:11,443 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:49:11,443 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:49:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-12-31 03:49:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:49:11,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:11,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:11,470 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2018-12-31 03:49:11,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:49:11,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:49:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:11,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:11,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:49:11,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:11,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:49:11,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:49:11,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:49:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:49:11,666 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-12-31 03:49:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:49:11,701 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2018-12-31 03:49:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:49:11,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:49:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:49:11,718 INFO L225 Difference]: With dead ends: 227 [2018-12-31 03:49:11,718 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 03:49:11,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:49:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 03:49:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-31 03:49:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-31 03:49:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2018-12-31 03:49:11,769 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2018-12-31 03:49:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:49:11,769 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2018-12-31 03:49:11,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:49:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2018-12-31 03:49:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:49:11,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:11,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:11,771 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2018-12-31 03:49:11,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:49:11,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:49:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:49:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:49:12,080 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:49:12,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:49:12 BoogieIcfgContainer [2018-12-31 03:49:12,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:49:12,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:49:12,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:49:12,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:49:12,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:11" (3/4) ... [2018-12-31 03:49:12,150 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:49:12,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:49:12,154 INFO L168 Benchmark]: Toolchain (without parser) took 3045.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -85.7 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:12,158 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:49:12,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.36 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 928.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:12,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:12,163 INFO L168 Benchmark]: Boogie Preprocessor took 103.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:12,164 INFO L168 Benchmark]: RCFGBuilder took 1543.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:12,165 INFO L168 Benchmark]: TraceAbstraction took 773.83 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:12,167 INFO L168 Benchmark]: Witness Printer took 11.83 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-12-31 03:49:12,174 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.36 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 928.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1543.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 773.83 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Witness Printer took 11.83 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: 260]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 251, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = -0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y < 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != -pi_o_2 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L260] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:49:14,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:49:14,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:49:14,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:49:14,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:49:14,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:49:14,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:49:14,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:49:14,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:49:14,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:49:14,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:49:14,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:49:14,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:49:14,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:49:14,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:49:14,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:49:14,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:49:14,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:49:14,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:49:14,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:49:14,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:49:14,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:49:14,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:49:14,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:49:14,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:49:14,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:49:14,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:49:14,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:49:14,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:49:14,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:49:14,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:49:14,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:49:14,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:49:14,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:49:14,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:49:14,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:49:14,703 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:49:14,719 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:49:14,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:49:14,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:49:14,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:49:14,720 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:49:14,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:49:14,721 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:49:14,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:49:14,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:49:14,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:49:14,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:49:14,722 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:49:14,722 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:49:14,722 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:49:14,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:49:14,722 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:49:14,723 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:49:14,723 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:49:14,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:49:14,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:49:14,723 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:49:14,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:49:14,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:49:14,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:49:14,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:49:14,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:49:14,724 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:49:14,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:49:14,725 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:49:14,725 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:49:14,725 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 -> c8db64e82d1b178f8644abd34ffdb7278ee391d6 [2018-12-31 03:49:14,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:49:14,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:49:14,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:49:14,779 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:49:14,779 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:49:14,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2018-12-31 03:49:14,840 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e3c8f17/49f22dbc4d844a7aae503245ff5184c5/FLAGf5f041a8d [2018-12-31 03:49:15,396 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:49:15,400 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2018-12-31 03:49:15,410 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e3c8f17/49f22dbc4d844a7aae503245ff5184c5/FLAGf5f041a8d [2018-12-31 03:49:15,652 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e3c8f17/49f22dbc4d844a7aae503245ff5184c5 [2018-12-31 03:49:15,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:49:15,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:49:15,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:15,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:49:15,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:49:15,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:15" (1/1) ... [2018-12-31 03:49:15,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e727def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:15, skipping insertion in model container [2018-12-31 03:49:15,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:15" (1/1) ... [2018-12-31 03:49:15,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:49:15,716 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:49:16,081 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:16,096 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:49:16,193 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:16,328 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:49:16,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16 WrapperNode [2018-12-31 03:49:16,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:16,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:16,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:49:16,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:49:16,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:16,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:49:16,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:49:16,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:49:16,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (1/1) ... [2018-12-31 03:49:16,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:49:16,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:49:16,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:49:16,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:49:16,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (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-12-31 03:49:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:49:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:49:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:49:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:49:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:49:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:49:16,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:49:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:49:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:49:17,150 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:17,228 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:17,308 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:17,495 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:17,572 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:18,375 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:18,437 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:37,679 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:37,700 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:37,747 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:37,810 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:38,582 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:38,610 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:54,196 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:54,270 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:54,787 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:49:54,787 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-31 03:49:54,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:54 BoogieIcfgContainer [2018-12-31 03:49:54,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:49:54,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:49:54,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:49:54,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:49:54,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:49:15" (1/3) ... [2018-12-31 03:49:54,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2737f876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:54, skipping insertion in model container [2018-12-31 03:49:54,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:16" (2/3) ... [2018-12-31 03:49:54,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2737f876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:54, skipping insertion in model container [2018-12-31 03:49:54,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:54" (3/3) ... [2018-12-31 03:49:54,796 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a_true-unreach-call.c [2018-12-31 03:49:54,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:49:54,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:49:54,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:49:54,862 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:49:54,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:49:54,863 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:49:54,863 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:49:54,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:49:54,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:49:54,863 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:49:54,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:49:54,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:49:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-12-31 03:49:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:49:54,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:54,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:54,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:54,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2018-12-31 03:49:54,905 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:49:54,907 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-12-31 03:49:54,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:55,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:49:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:49:55,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:49:55,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:55,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:49:55,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:49:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:49:55,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:49:55,212 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-12-31 03:49:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:49:55,247 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2018-12-31 03:49:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:49:55,249 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:49:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:49:55,263 INFO L225 Difference]: With dead ends: 227 [2018-12-31 03:49:55,263 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 03:49:55,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-12-31 03:49:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 03:49:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-31 03:49:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-31 03:49:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2018-12-31 03:49:55,312 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2018-12-31 03:49:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:49:55,312 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2018-12-31 03:49:55,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:49:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2018-12-31 03:49:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:49:55,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:55,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:55,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:55,315 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2018-12-31 03:49:55,316 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:49:55,316 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-12-31 03:49:55,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:55,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:49:56,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,173 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,174 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,177 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2018-12-31 03:49:56,400 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-31 03:49:56,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,440 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 59 treesize of output 59 [2018-12-31 03:49:56,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-12-31 03:49:56,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 28 [2018-12-31 03:49:56,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-31 03:49:56,804 INFO L478 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 24 treesize of output 9 [2018-12-31 03:49:56,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:49:57,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-31 03:49:57,155 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:98, output treesize:38 [2018-12-31 03:49:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:49:57,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:49:57,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:57,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:49:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:49:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:49:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:49:57,829 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 8 states. [2018-12-31 03:49:59,047 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-31 03:50:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:01,204 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2018-12-31 03:50:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:01,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-12-31 03:50:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:01,563 INFO L225 Difference]: With dead ends: 167 [2018-12-31 03:50:01,563 INFO L226 Difference]: Without dead ends: 68 [2018-12-31 03:50:01,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:50:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-31 03:50:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-31 03:50:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-31 03:50:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-12-31 03:50:01,584 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 13 [2018-12-31 03:50:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:01,584 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-12-31 03:50:01,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-12-31 03:50:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:50:01,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:01,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:01,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1226339013, now seen corresponding path program 1 times [2018-12-31 03:50:01,589 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:01,589 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-12-31 03:50:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:01,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:02,377 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:02,564 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:02,963 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:02,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:02,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:02,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:50:02,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:50:02,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:50:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:50:02,988 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 6 states. [2018-12-31 03:50:03,999 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:04,265 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:05,344 WARN L181 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:50:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:07,192 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-12-31 03:50:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:50:07,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-31 03:50:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:07,195 INFO L225 Difference]: With dead ends: 72 [2018-12-31 03:50:07,195 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 03:50:07,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:50:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 03:50:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-31 03:50:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 03:50:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-12-31 03:50:07,214 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 18 [2018-12-31 03:50:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:07,214 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-12-31 03:50:07,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:50:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-12-31 03:50:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:50:07,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:07,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:07,217 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash 48409528, now seen corresponding path program 1 times [2018-12-31 03:50:07,217 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:07,218 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-12-31 03:50:07,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:07,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:07,729 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:08,098 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:08,298 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:08,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:08,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:08,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:50:08,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:50:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:50:08,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:50:08,322 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2018-12-31 03:50:09,080 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:11,065 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:11,515 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:50:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:14,310 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-12-31 03:50:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:50:14,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-31 03:50:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:14,312 INFO L225 Difference]: With dead ends: 70 [2018-12-31 03:50:14,313 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 03:50:14,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:50:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 03:50:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-31 03:50:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-31 03:50:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-12-31 03:50:14,331 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 20 [2018-12-31 03:50:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:14,332 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-12-31 03:50:14,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:50:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2018-12-31 03:50:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:50:14,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:14,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:14,333 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2018-12-31 03:50:14,336 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:14,336 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-12-31 03:50:14,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:14,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:14,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:14,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:50:14,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:50:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:50:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:50:14,907 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 7 states. [2018-12-31 03:50:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:18,277 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-12-31 03:50:18,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:50:18,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 03:50:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:18,279 INFO L225 Difference]: With dead ends: 68 [2018-12-31 03:50:18,279 INFO L226 Difference]: Without dead ends: 59 [2018-12-31 03:50:18,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:50:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-31 03:50:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-31 03:50:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-31 03:50:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2018-12-31 03:50:18,294 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 21 [2018-12-31 03:50:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:18,294 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-12-31 03:50:18,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:50:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-12-31 03:50:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 03:50:18,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:18,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:18,296 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1649788032, now seen corresponding path program 1 times [2018-12-31 03:50:18,297 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:18,297 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) [2018-12-31 03:50:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:18,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:20,636 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-31 03:50:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:22,759 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:22,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:22,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 03:50:22,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 03:50:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 03:50:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:50:22,779 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 11 states. [2018-12-31 03:50:26,079 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-12-31 03:50:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:30,956 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-12-31 03:50:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:50:30,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-31 03:50:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:30,957 INFO L225 Difference]: With dead ends: 73 [2018-12-31 03:50:30,957 INFO L226 Difference]: Without dead ends: 69 [2018-12-31 03:50:30,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-31 03:50:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-31 03:50:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-12-31 03:50:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-31 03:50:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-12-31 03:50:30,978 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 23 [2018-12-31 03:50:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:30,980 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-12-31 03:50:30,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 03:50:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-12-31 03:50:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 03:50:30,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:30,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:30,982 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash -394512707, now seen corresponding path program 1 times [2018-12-31 03:50:30,983 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:30,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:50:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:31,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:31,636 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:31,637 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:31,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-12-31 03:50:31,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:50:31,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 53 [2018-12-31 03:50:31,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:50:31,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-12-31 03:50:31,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:31,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:31,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-31 03:50:31,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:50:31,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-31 03:50:31,790 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:31,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:31,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:31,811 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-12-31 03:50:31,811 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:58, output treesize:19 [2018-12-31 03:50:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:31,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:31,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:31,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:50:31,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:50:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:50:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:50:31,906 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 6 states. [2018-12-31 03:50:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:32,130 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-12-31 03:50:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:50:32,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-31 03:50:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:32,132 INFO L225 Difference]: With dead ends: 63 [2018-12-31 03:50:32,132 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:50:32,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:50:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:50:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:50:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:50:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:50:32,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-12-31 03:50:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:32,134 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:50:32,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:50:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:50:32,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:50:32,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:50:32,446 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 03:50:33,211 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-12-31 03:50:34,024 WARN L181 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-31 03:50:34,027 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:50:34,027 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:50:34,028 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2018-12-31 03:50:34,028 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:50:34,028 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-31 03:50:34,028 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2018-12-31 03:50:34,028 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:50:34,029 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2018-12-31 03:50:34,030 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2018-12-31 03:50:34,030 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:50:34,030 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:50:34,030 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-31 03:50:34,030 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse1 (fp.neg (_ +zero 11 53))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) .cse0) |ULTIMATE.start___ieee754_atan2_#res|) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~hy~0) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~ly~0))) (= ULTIMATE.start_main_~x~0 .cse1) (= .cse1 ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 .cse0) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_17|)) ULTIMATE.start___ieee754_atan2_~iy~0) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~ly~0))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53))))))) [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:50:34,031 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:50:34,032 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= ULTIMATE.start_main_~x~0 .cse0) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)))) [2018-12-31 03:50:34,032 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:50:34,032 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-31 03:50:34,032 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2018-12-31 03:50:34,032 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-31 03:50:34,032 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:50:34,032 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2018-12-31 03:50:34,033 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:50:34,033 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2018-12-31 03:50:34,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:50:34,034 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2018-12-31 03:50:34,034 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2018-12-31 03:50:34,034 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-31 03:50:34,034 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-12-31 03:50:34,034 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:50:34,034 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (exists ((|v_q#valueAsBitvector_21| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_21|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_21|)))) (= ULTIMATE.start_main_~x~0 .cse0) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53))))))) [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:50:34,035 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:50:34,036 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2018-12-31 03:50:34,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:50:34,038 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2018-12-31 03:50:34,038 INFO L448 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2018-12-31 03:50:34,038 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2018-12-31 03:50:34,038 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:50:34,038 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:50:34,038 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2018-12-31 03:50:34,038 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2018-12-31 03:50:34,038 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2018-12-31 03:50:34,038 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2018-12-31 03:50:34,039 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2018-12-31 03:50:34,040 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2018-12-31 03:50:34,040 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2018-12-31 03:50:34,040 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2018-12-31 03:50:34,040 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:50:34,040 INFO L451 ceAbstractionStarter]: At program point L265(lines 244 266) the Hoare annotation is: true [2018-12-31 03:50:34,040 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-31 03:50:34,040 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:50:34,040 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2018-12-31 03:50:34,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,055 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,058 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,058 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,061 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,062 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,065 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,066 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,069 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,069 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,070 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,070 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,072 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,077 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,077 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,078 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:50:34 BoogieIcfgContainer [2018-12-31 03:50:34,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:50:34,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:50:34,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:50:34,084 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:50:34,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:54" (3/4) ... [2018-12-31 03:50:34,089 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:50:34,121 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-31 03:50:34,122 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-31 03:50:34,157 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && (\exists v_q#valueAsBitvector_21 : bv64 :: (hx == v_q#valueAsBitvector_21[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_21[63:63], v_q#valueAsBitvector_21[62:52], v_q#valueAsBitvector_21[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && lx == v_q#valueAsBitvector_21[31:0])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2018-12-31 03:50:34,158 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_q#valueAsBitvector_16[63:32] == hx)) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && (\exists v_q#valueAsBitvector_17 : bv64 :: (v_q#valueAsBitvector_17[63:32] == hy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_17 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2018-12-31 03:50:34,233 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:50:34,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:50:34,234 INFO L168 Benchmark]: Toolchain (without parser) took 78577.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -69.7 MB). Peak memory consumption was 139.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,235 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:50:34,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,236 INFO L168 Benchmark]: Boogie Preprocessor took 108.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,237 INFO L168 Benchmark]: RCFGBuilder took 38262.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,237 INFO L168 Benchmark]: TraceAbstraction took 39294.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,237 INFO L168 Benchmark]: Witness Printer took 149.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:34,243 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 670.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38262.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39294.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 85.9 MB. Max. memory is 11.5 GB. * Witness Printer took 149.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: 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: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2018-12-31 03:50:34,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2018-12-31 03:50:34,259 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,264 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,265 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2018-12-31 03:50:34,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: (((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && (\exists v_q#valueAsBitvector_21 : bv64 :: (hx == v_q#valueAsBitvector_21[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_21[63:63], v_q#valueAsBitvector_21[62:52], v_q#valueAsBitvector_21[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && lx == v_q#valueAsBitvector_21[31:0])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 142]: Loop Invariant [2018-12-31 03:50:34,270 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,273 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,274 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,275 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,281 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,281 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,282 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:50:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:50:34,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: ((((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_q#valueAsBitvector_16[63:32] == hx)) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && (\exists v_q#valueAsBitvector_17 : bv64 :: (v_q#valueAsBitvector_17[63:32] == hy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_17 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. SAFE Result, 39.1s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 25.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 520 SDtfs, 1009 SDslu, 938 SDs, 0 SdLazy, 167 SolverSat, 43 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred 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, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 201 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 123 ConstructedInterpolants, 43 QuantifiedInterpolants, 32752 SizeOfPredicates, 43 NumberOfNonLiveVariables, 947 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...